• Corpus ID: 118060931

Channel Codes: Classical and Modern

@inproceedings{Ryan2009ChannelCC,
  title={Channel Codes: Classical and Modern},
  author={William E. Ryan and Shu Lin},
  year={2009}
}
Preface 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 10. Finite geometry LDPC codes 11. Constructions of LDPC codes 12. LDPC codes based on combinatorial designs, graphs, and superposition 13. LDPC codes for binary… 
CONSTRUCTION OF REGULAR LDPC LIKE CODES BASED ON FULL RANK CODES AND THEIR ITERATIVE DECODING USING A PARITY CHECK TREE
TLDR
A novel low complexity algebraic method for constructing regular LDPC like codes derived from full rank codes is discussed and it is demonstrated that by employing these codes over AWGN channels, coding gains in excess of 2dB over un-coded systems can be realized when soft iterative decoding using a parity check tree is employed.
Quasi-Cyclic LDPC Codes: An Algebraic Construction, Rank Analysis, and Codes on Latin Squares
TLDR
An approach for constructing quasi-cyclic LDPC codes based on Latin squares over finite fields based on parity-check matrices is presented, and combinatorial expressions for their ranks and dimensions are derived.
Convolutional Versus LDPC and Turbo Codes on the Rayleigh Fading Channel
TLDR
This work considers the performance of low-density parity-check (LDPC) codes, turbo codes and convolutional codes over the binary-input AWGN channel with flat Rayleigh fading and finds that for very short codewords, the Convolutional code performs best.
Quasi-cyclic LDPC codes: an algebraic construction
TLDR
Two new large classes of QC-LDPC codes, one binary and one non-binary, are presented, which have potential to replace Reed-Solomon codes in some communication or storage systems where combinations of random and bursts of errors (or erasures) occur.
Linear Permutation Polynomial Codes
TLDR
A new class of LDPC codes, named linear permutation polynomial (LPP) codes, whose parity-check matrix consists of permutation matrices based on LPPs, demonstrating that LPP codes have error performance almost equivalent to random ones.
Concatenated finite geometry and finite field LDPC codes
TLDR
Two types of concatenated finite-geometry and finite-field LDPC codes are presented which have the distinct features of both finite geometry and finite fieldLDPC codes, such as large minimum distances, no small trapping sets, fast decoding convergence, flexibility in code construction, cyclic and quasi-cyclic structures.
Construction of Partial Geometries and LDPC codes based on Reed-Solomon Codes
TLDR
It is shown thatLDPC codes constructed based on Reed-Solomon codes of prime lengths are finite geometry LDPC codes and a new method for design and construction of nonbinary quasi-cyclic LDPC code based on the conventional parity-check matrices of Reed- Solomon codes is presented.
A reduced-complexity iterative scheme for decoding quasi-cyclic low-density parity-check codes
TLDR
A reduced-complexity iterative decoding scheme for quasi-cyclic (QC) low-density parity-check (LDPC) codes which is devised based on the section-wise cyclic structure of their parity- check matrices is presented.
Graph-Based Codes
TLDR
This chapter gives detailed introductions to parallel and serial convolutional turbo codes, BTCs, and LDPC codes, and the binary-input additive white Gaussian noise (AWGN) channel model to make discussions more concrete.
Development and Verification of Iterative Decoder for LDPC-RS Product Codes
TLDR
An iterative decoder scheme for LDPC-RS product codes which made LDPC codes and Turbo codes popular is developed in MATLAB and FPGA kit is used for practical verification.
...
1
2
3
4
5
...