Error Correction Coding
Home > Science, Technology & Agriculture > Electronics and communications engineering > Communications engineering / telecommunications > Error Correction Coding: Mathematical Methods and Algorithms
Error Correction Coding: Mathematical Methods and Algorithms

Error Correction Coding: Mathematical Methods and Algorithms


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

An unparalleled learning tool and guide to error correction coding Error correction coding techniques allow the detection and correction of errors occurring during the transmission of data in digital communication systems. These techniques are nearly universally employed in modern communication systems, and are thus an important component of the modern information economy. Error Correction Coding: Mathematical Methods and Algorithms provides a comprehensive introduction to both the theoretical and practical aspects of error correction coding, with a presentation suitable for a wide variety of audiences, including graduate students in electrical engineering, mathematics, or computer science. The pedagogy is arranged so that the mathematical concepts are presented incrementally, followed immediately by applications to coding. A large number of exercises expand and deepen students' understanding. A unique feature of the book is a set of programming laboratories, supplemented with over 250 programs and functions on an associated Web site, which provides hands-on experience and a better understanding of the material. These laboratories lead students through the implementation and evaluation of Hamming codes, CRC codes, BCH and R-S codes, convolutional codes, turbo codes, and LDPC codes. This text offers both "classical" coding theory-such as Hamming, BCH, Reed-Solomon, Reed-Muller, and convolutional codes-as well as modern codes and decoding methods, including turbo codes, LDPC codes, repeat-accumulate codes, space time codes, factor graphs, soft-decision decoding, Guruswami-Sudan decoding, EXIT charts, and iterative decoding. Theoretical complements on performance and bounds are presented. Coding is also put into its communications and information theoretic context and connections are drawn to public key cryptosystems. Ideal as a classroom resource and a professional reference, this thorough guide will benefit electrical and computer engineers, mathematicians, students, researchers, and scientists.

Table of Contents:
Preface vii List of Program Files xxxi List of Laboratory Exercises xxxii               List of Algorithms xxxiv List of Figures xl List of Tables xlii List of Boxes xliii Part I: Introduction and Foundations 1 1 A Context for Error Correction Coding 2 Part II: Block Codes 61 2 Groups and Vector Spaces 62 3 Linear Block Codes 83 4 Cyclic Codes, Rings, and Polynomials 113 5 Rudiments of Number Theory and Algebra 171 6 BCH and Reed-Solomon Codes: Designer Cyclic Codes 235 7 Alternate Decoding Algorithms for Reed-Solomon Codes 293 8 Other Important Block Codes 369 9 Bounds on Codes 406 10 Bursty Channels, Interleavers, and Concatenation 425 11 Soft-Decision Decoding Algorithms 439 Part III: Codes on Graphs 451 12 Convolutional Codes 452 13 Trellis Coded Modulation 535 Part IV: Iteratively Decoded Codes 581 14 Turbo Codes 582 15 Low-Density Parity-Check Codes 634 16 Decoding Algorithms on Graphs 680 Part V: Space-Time Coding 709 17 Fading Channels and Space-Time Codes 710 A Log Likelihood Algebra 735 References 739 Index 750

About the Author :
TODD K. MOON is a Professor in the Electrical and Computer Engineering Department at Utah State University and a senior member of the IEEE. His research interests include application of mathematical principles to problems involving the transmission, extraction, modeling, compression or analysis of signals. He is the coauthor of a widely-adopted graduate-level textbook in signal processing and author of numerous articles and conference presentations, as well as a children's book on programming. He also consults widely for industry.

Review :
"…one of the best error control coding books on the market. I highly recommend it for both academic study and practical reference." (Computing Reviews.com, January 16, 2006) "Overall this text book is well written and easy to read…comprehensive…" (IEEE Communications Magazine, April 2007)


Best Sellers


Product Details
  • ISBN-13: 9780471739142
  • Publisher: John Wiley and Sons Ltd
  • Publisher Imprint: John Wiley & Sons Ltd
  • Language: English
  • Sub Title: Mathematical Methods and Algorithms
  • ISBN-10: 0471739146
  • Publisher Date: 08 Jul 2005
  • Binding: Digital (delivered electronically)
  • No of Pages: 800


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Error Correction Coding: Mathematical Methods and Algorithms
John Wiley and Sons Ltd -
Error Correction Coding: Mathematical Methods and Algorithms
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Error Correction Coding: Mathematical Methods and Algorithms

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!