Channel Codes: Classical and Modern [Hardcover]

Introduction to the theory and practice of channel codes for reliable communication and data storage, with numerous examples and problems.This book is for students, researchers, and practitioners interested in codes for error correction in data communication systems and data storage devices. Both theory and practice of classical and modern channel coding techniques are covered.This book is for students, researchers, and practitioners interested in codes for error correction in data communication systems and data storage devices. Both theory and practice of classical and modern channel coding techniques are covered.Channel coding lies at the heart of digital communication and data storage. Fully updated, including a new chapter on polar codes, this detailed introduction describes the core theory of channel coding, decoding algorithms, implementation details, and performance analyses. This new edition includes over 50 new end-of-chapter problems and new figures and worked examples throughout. The authors emphasize the practical approach and present clear information on modern channel codes, including turbo and low-density parity-check (LDPC) codes, detailed coverage of BCH codes, Reed-Solomon codes, convolutional codes, finite geometry codes, product codes as well as polar codes for error correction and detection, providing a one-stop resource for classical and modern coding techniques. Assuming no prior knowledge in the field of channel coding, the opening chapters begin with basic theory to introduce newcomers to the subject. Later chapters then extend to advanced topics such as code ensemble performance analyses and algebraic code design.1. Coding and Capacity; 2. Finite Fields, Vector Spaces, Finite Geometries, and Graphs; 3. Linear Block Codes; 4. Convolutional Codes; 5. Low-Density Parity-Check Codes; 6. Computer-Based Design of LDPC Codes; 7. Turbo Codes; 8. Ensemble Enumerators for Turbo and LDPC Codes; 9. Ensemble Decoding Thresholds for LDPC and Turbo Codes;l��