Book contents
- Channel Codes
- Channel Codes
- Copyright page
- Dedication
- Contents
- Detailed Contents
- Preface to the Second Edition
- Acknowledgments (Second Edition)
- Preface to the First Edition
- Acknowledgments (First Edition)
- 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 Polar Codes
- 11 Finite-Geometry LDPC Codes
- 12 Constructions of LDPC Codes Based on Finite Fields
- 13 LDPC Codes Based on Combinatorial Designs, Graphs, and Superposition
- 14 LDPC Codes for Binary Erasure Channels
- 15 Nonbinary LDPC Codes
- Index
- References
15 - Nonbinary LDPC Codes
Published online by Cambridge University Press: 06 March 2025
Book contents
- Channel Codes
- Channel Codes
- Copyright page
- Dedication
- Contents
- Detailed Contents
- Preface to the Second Edition
- Acknowledgments (Second Edition)
- Preface to the First Edition
- Acknowledgments (First Edition)
- 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 Polar Codes
- 11 Finite-Geometry LDPC Codes
- 12 Constructions of LDPC Codes Based on Finite Fields
- 13 LDPC Codes Based on Combinatorial Designs, Graphs, and Superposition
- 14 LDPC Codes for Binary Erasure Channels
- 15 Nonbinary LDPC Codes
- Index
- References
Summary
Channel coding lies at the heart of digital communication and data storage. Fully updated to include current innovations in the field, 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 edition includes over 50 new end-of-chapter problems to challenge students and numerous new figures and examples throughout.
The authors emphasize a practical approach and clearly present information on modern channel codes, including polar, turbo, and low-density parity-check (LDPC) codes, as well as detailed coverage of BCH codes, Reed–Solomon codes, convolutional codes, finite geometry codes, and product codes for error correction, 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 begin with classical codes, continue with modern codes, and extend to advanced topics such as code ensemble performance analyses and algebraic LDPC code design.
300 varied and stimulating end-of-chapter problems test and enhance learning, making this an essential resource for students and practitioners alike.
Provides a one-stop resource for both classical and modern coding techniques.
Starts with the basic theory before moving on to advanced topics, making it perfect for newcomers to the field of channel coding.
180 worked examples guide students through the practical application of the theory.
- Type
- Chapter
- Information
- Channel CodesClassical and Modern, pp. 703 - 757Publisher: Cambridge University PressPrint publication year: 2024
References
Davey, M. C. and MacKay, D. J. C., “Low-density parity check codes over GF(q),” IEEE Communications Letters, vol. 2, no. 6, pp. 165–167, June 1998.Google Scholar
MacKay, D. J. C. and Davey, M. C., “Evaluation of Gallager codes of short block length and high rate applications,” Proceedings of the IMA International Conference on Mathematics and Its Applications: Codes, Systems and Graphical Models, New York, Springer-Verlag, 2000, pp. 113–130.Google Scholar
Barnault, L. and Declercq, D., “Fast decoding algorithm for LDPC over GF(2q),” Proceedings of the 2003 IEEE Information Theory Workshop, Paris, March 31– April 4, 2003, pp. 70–73.Google Scholar
Declercq, D. and Fossorier, M., “Decoding algorithms for nonbinary LDPC codes over GF(q),” IEEE Transactions on Communications, vol. 55, no. 4, pp. 633–643, April 2007.CrossRefGoogle Scholar
Boutros, J. I., Ghaith, A., and Yun-Wu, Yi, “Non-binary adaptive LDPC codes for frequency selective channels: Code construction and iterative decoding,” Proceedings of the IEEE Information Theory Workshop, Chengdu, October 2007, pp. 184–188.Google Scholar
Poulliat, C., Fossorier, M., and Declercq, D., “Optimization of non binary LDPC codes using their binary images,” Proceedings of the International Turbo Code Symposium, Munich, April 2006.Google Scholar
Poulliat, C., Fossorier, M., and Declercq, D., “Design of non binary LDPC codes using their binary images: Algebraic properties,” Proceedings of the IEEE International Symposium on Information Theory, Seattle, WA, July 2006.Google Scholar
Voicila, A., Declercq, D., Verdier, F., Fossorier, M., and Urard, P., “Split non-binary LDPC codes,” Proceedings of the IEEE International Symposium on Information Theory, Toronto, Ontario, July 6–11, 2008.Google Scholar
Lin, S., Song, S., Zhou, B., Kang, J., Tai, Y. Y., and Huang, Q., “Algebraic constructions of nonbinary quasi-cyclic LDPC codes: Array masking and dispersion,” Proceedings of the 2nd Workshop for the Center of Information Theory and its Applications, UCSD Division of Calit2 and the Jacobs School of Engineering, San Diego, CA, January 29–February 2, 2007.Google Scholar
Rathi, V. and Urbanke, R., “Density evolution, thresholds and the stability condition for non-binary LDPC codes,” IEE Proceedings on Communications, vol. 152, no. 6, pp. 1069–1074, December 2005.CrossRefGoogle Scholar
Song, S., Zeng, L., Lin, S., and Abdel-Ghaffar, K., “Algebraic constructions of nonbinary quasi-cyclic LDPC codes,” Proceedings of the IEEE International Symposium on Information Theory, Seattle, WA, July 9–14, 2006, pp. 83–87.Google Scholar
Zeng, L., Lan, L., Tai, Y. Y., and Lin, S., “Dispersed Reed–Solomon codes for iterative decoding and construction of q-ary LDPC codes,” in Proceedings of the IEEE Global Telecommunications Conference, St. Louis, MO, November 28–December 2, 2005, pp. 1193–1198.Google Scholar
Zeng, L., Lan, L., Tai, Y. Y., Zhou, B., Lin, S., and Abdel-Ghaffar, K. A. S., “Construction of nonbinary cyclic, quasi-cyclic and regular LDPC codes: A finite geometry approach,” IEEE Transactions on Communications, vol. 56, no. 3, pp. 378–387, March 2008.CrossRefGoogle Scholar
Zeng, L., Lan, L., Tai, Y. Y., Song, S., Lin, S., and Abdel-Ghaffar, K., “Constructions of nonbinary quasi-cyclic LDPC codes: A finite field approach,” IEEE Transactions on Communications, vol. 56, no. 4, pp. 545–554, April 2008.CrossRefGoogle Scholar
Zhou, B., Kang, J., Tai, Y. Y., Lin, S., and Ding, Z., “High performance non-binary quasi-cyclic LDPC codes on Euclidean geometries,” IEEE Transactions on Communications, vol. 57, no. 4, pp. 545–554, April 2009.CrossRefGoogle Scholar
Zhou, B., Kang, J., Song, S., Lin, S., Abdel-Ghaffar, K., and Xu, M., “Construction of non-binary quasi-cyclic LDPC codes by arrays and array dispersions,” IEEE Transactions on Communications, vol. 57, no. 6, pp. 1652–1662, June 2009.CrossRefGoogle Scholar
Zhou, B., Kang, J., Tai, Y. Y., Huang, Q., and Lin, S., “High performance nonbinary quasi-cyclic LDPC codes on Euclidean geometries,” Proceedings of the 2007 Military Communications Conference (MILCOM 2007), Orlando, FL, October 29–31, 2007.Google Scholar
Zhou, B., Tai, Y. Y., Lan, L., Song, S., Zeng, L., and Lin, S., “Construction of high performance and efficiently encodable nonbinary quasi-cyclic LDPC codes,” Proceedings of the IEEE Global Telecommunications Conference, San Francisco, CA, November 27–December 1, 2006.Google Scholar
Zhou, B., Zhang, L., Kang, J., Huang, Q., Tai, Y. Y., and Lin, S., “Non-binary LDPC codes vs. Reed–Solomon codes,” Proceedings of the 3rd Workshop for the Center of Information Theory and its Applications, UCSD Division of Calit2 and the Jacobs School of Engineering, San Diego, CA, January 27–February 1, 2008.Google Scholar
Zhou, B., Zhang, L., Huang, Q., Lin, S., and Xu, M., “Constructions of high performance non-binary quasi-cyclic LDPC codes,” Proceedings of the IEEE Information Theory Workshop (ITW), pp. 71–75, Porto, May 5–9, 2008.Google Scholar
Zhou, B., Zhang, L., Kang, J. Y., Huang, Q., Lin, S. and Abdel-Ghaffar, K., “Array dispersions of matrices and constructions of quasi-cyclic LDPC codes over non-binary fields,” Proceedings of the IEEE International Symposium on Information Theory, Toronto, Ontario, July 6–11, 2008.Google Scholar
Gross, W. J., Kschischang, F. R., Kötter, R., and Gulak, P. G., “Applications of algebraic soft-decision decoding of Reed–Solomon codes,” IEEE Transactions on Communications, vol. 54, no. 7, pp. 1224–1234, July 2006.CrossRefGoogle Scholar
Wymeersch, H., Steendam, H., and Moeneclaey, M., “Log-domain decoding of LDPC codes over GF(q),” Proceedings of the IEEE International Conference on Communications, Paris, June 2004, pp. 772–776.Google Scholar
Berlekamp, E. R., Algebraic Coding Theory, New York, McGraw-Hill, 1968 (revised edition Laguna Hill, CA, Aegean Park Press, 1984).Google Scholar
Massey, J. L., “Shift-register synthesis and BCH decoding,” IEEE Transactions on Information Theory, vol. 15, no. 1, pp. 122–127, January 1969.Google Scholar
Kötter, R. and Vardy, A., “Algebraic soft-decision decoding of Reed–Solomon codes,” IEEE Transactions on Information Theory, vol. 49, no. 11, pp. 2809–2825, November 2003.CrossRefGoogle Scholar
El-Khamy, M. and McEliece, R., “Iterative algebraic soft-decision list decoding of RS codes,” IEEE Journal on Selected Areas in Communications, vol. 24, no. 3, pp. 481–490, March 2006.CrossRefGoogle Scholar
Lin, S. and Costello, D. J., Jr., Error Control Coding: Fundamentals and Applications, 2nd ed., Upper Saddle River, NJ, Prentice-Hall, 2004.Google Scholar
Bennatan, A. and Burshtein, D., “Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels,” IEEE Transactions on Information Theory, vol. 52, no. 2, pp. 549–583, February 2006.CrossRefGoogle Scholar
MacKay, D. J. C., “Good error-correcting codes based on very sparse matrices,” IEEE Transactions on Information Theory, vol. 45, no. 2, pp. 399–432, March 1999.Google Scholar
Goupil, A., Colas, M., Gelle, G., and Declercq, D., “On BP decoding of LDPC codes over groups,” Proceedings of the International Symposium on Turbo Codes, Munich, April 2006, CD-ROM.Google Scholar
Goupil, A., Colas, M., Gelle, G., and Declercq, D., “FFT-based BP decoding of general LDPC codes over Abelian groups,” IEEE Transactions on Communications, vol. 55, no. 4, pp. 644–649, April 2007.Google Scholar
Kou, Y., Lin, S., and Fossorier, M., “Low-density parity-check codes based on finite geometries: A rediscovery and new results,” IEEE Transactions on Information Theory, vol. 47, no. 7, pp. 2711–2736, November 2001.CrossRefGoogle Scholar
Li, Z., Chen, L., Zeng, L., Lin, S., and Fong, W., “Efficient encoding of quasi-cyclic low-density parity-check codes,” IEEE Transactions on Communications, vol. 54, no. 1, pp. 71–81, January 2006.Google Scholar
Li, X. and Soleymani, M. R., “A proof of the Hadamard transform decoding of the belief propagation decoding for LDPCC over GF(q),” Proceedings of the Fall Vehicle Technology Conference, vol. 4, September 2004, pp. 2518–2519.Google Scholar
Song, H. and Cruz, J. R., “Reduced-complexity decoding of Q-ary LDPC codes for magnetic recording,” IEEE Transactions on Magnetics, vol. 39, no. 2, pp. 1081–1087, March 2003.CrossRefGoogle Scholar
Li, J., Lin, S., Abdel-Ghaffar, K., Ryan, W. E., and Costello, D. J., LDPC Code Designs, Constructions, and Unification, Cambridge, Cambridge University Press, 2017.Google Scholar