Channel Codes: Classical and Modern
Channel coding lies at the heart of digital communication and data storage, and this detailed introduction describes the core theory as well as decoding algorithms, implementation details, and performance analyses. In this book, Professors Ryan and Lin provide clear information on modern channel codes, including turbo and low-density parity-check (LDPC) codes. They also present detailed coverage of BCH codes, Reed-Solomon codes, convolutional codes, finite geometry codes, and product codes, providing a one-stop resource for both 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. 250 varied and stimulating end-of-chapter problems are also included to test and enhance learning, making this an essential resource for students and practitioners alike.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Finite Fields Vector Spaces Finite Geometries and Graphs
Linear Block Codes
LowDensity ParityCheck Codes
ComputerBased Design of LDPC Codes
Ensemble Enumerators for Turbo and LDPC Codes
Ensemble Decoding Thresholds for LDPC and Turbo Codes
Other editions - View all
50 iterations BCH code BCJR binary binary-input AWGN channel Chapter check nodes circulant permutation code bits code construction code given code rate codeword column and row column weight compute constraint convolutional code corresponding coset CPMs cyclic code decoding algorithm degree distributions denoted Eb/N0 dB encoder erasure error pattern error performance Euclidean geometry extrinsic information FFT-QSPA finite field GF(p GF(q GF(qm girth given in Example IEEE Trans incidence vectors Information Theory input integer interleaver IRA codes irregular LDPC iterative decoding LDPC codes length linear block code low-density parity-check codes masking matrix matrix H matrix over GF(2 minimum distance multiplication n-tuple null space output parity parity-check matrix PCCC permutation matrices polynomial protograph QC-LDPC code qc,disp RC-constraint row weights sequence Shannon limit shown in Figure subarray symbol Tanner graph trapping sets trellis turbo codes variable nodes word-error performances zero matrices