• Corpus ID: 28213032

Error control coding - fundamentals and applications

  title={Error control coding - fundamentals and applications},
  author={Shu Lin and Daniel J. Costello},
  booktitle={Prentice Hall computer applications in electrical engineering series},
1. Coding for Reliable Digital Transmission and Storage. 2. Introduction to Algebra. 3. Linear Block Codes. 4. Important Linear Block Codes. 5. Cyclic Codes. 6. Binary BCH Codes. 7. Nonbinary BCH Codes, Reed-Solomon Codes, and Decoding Algorithms. 8. Majority-Logic Decodable Codes. 9. Trellises for Linear Block Codes. 10. Reliability-Based Soft-Decision Decoding Algorithms for Linear Block Codes. 11. Convolutional Codes. 12. Trellis-Based Decoding Algorithms for Convolutional Codes. 13… 
A Novel Coding Scheme for Encoding and Iterative Soft-Decision Decoding of Binary BCH Codes of Prime Lengths
A novel coding scheme is presented for encoding and iterative soft-decision decoding of binary BCH codes of prime lengths which can achieve a joint-decoding gain over the maximum likelihood decoding of individual codewords.
On the design of Cyclic-QC-LDPC codes
This thesis introduces an efficient coding technique named as Cyclic-Quasi-Cyclic (QC)-LDPC, which requires more than one encoder compared to cyclic codes; QC codes are combined with Euclidean Geometry Cyclic LDPC codes and their performance over AWGN is verified.
A Scheme for Collective Encoding and Iterative Soft-Decision Decoding of Cyclic Codes of Prime Lengths: Applications to Reed–Solomon, BCH, and Quadratic Residue Codes
For decoding Reed-Solomon and BCH codes of prime lengths, the proposed decoding scheme not only requires much lower decoding complexity than other soft-decision decoding algorithms for these codes, but also yields superior performance.
Quasi-cyclic LDPC codes: an algebraic construction
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.
Simplified decoding techniques for linear block codes
This thesis focuses on reducing the computational effort and enhancing the efficiency of decoding algorithms for several codes from algorithmic as well as architectural standpoint and explores a method of constructing optimal codes by computing the subfield subcodes of Generalized Toric codes that is a natural extension of RS codes over several dimensions.
Serial Concatenation of RS Codes with Kite Codes: Performance Analysis, Iterative Decoding and Design
Numerical results along with semi-analytic bounds show that the proposed codes can approach Shannon limits with extremely low error-floors, and it is shown by simulation thatThe proposed codes performs well within a wide range of signal-to-noise-ratios (SNRs).
Advanced Coding and Coded Modulation Techniques
This chapter is devoted to advanced channel coding and coded modulation techniques and describes coding with interleaving as an efficient way to deal with burst of errors and fading effects.
Essentials of Error-control Coding
Preface & Acknowledgements. Symbols & Abbreviations. 1 INFORMATION AND CODING THEORY. 1.2 Entropy and Information Rate. 1.3 Extended Discrete Memoryless Source. 1.4 Channels and Mutual Information.
LDPC-An inevitable code for communication systems
This paper investigates problem in channel coding process (i.e) noisy channel coding which leads to non-optimal communication and visualizes the existing coding schemes for channel coding, and shows how the LDPC code can be suited for the optimal channel coding scheme.
Turbo Coding, Turbo Equalisation and Space-Time Coding for Transmission over Fading Channels
This paper presents a Comparative Study of Turbo Equalisers: The Super Trellis Structure of Convolutional Turbo Codes and the Coded Modulation Theory and Performance.