Efficient encoding of QC-LDPC codes related to cyclic MDS codes

Authors:
Norifumi Kamiya;Eisaku Sasaki
Affiliations:
Common Platform Software Research Laboratories, NEC Corporation, Kawasaki, Kanagawa, Japan;NEC Corporation, Kawasaki, Kanagawa, Japan
Venue:
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Year:
2009

Citing 8
Cited 2

Information Theory, Inference & Learning Algorithms

Information Theory, Inference & Learning Algorithms
Efficient encoding of low-density parity-check codes

IEEE Transactions on Information Theory
Low-density parity-check codes based on finite geometries: a rediscovery and new results

IEEE Transactions on Information Theory
Quasicyclic low-density parity-check codes from circulant permutation matrices

IEEE Transactions on Information Theory
High-Rate Quasi-Cyclic Low-Density Parity-Check Codes Derived From Finite Affine Planes

IEEE Transactions on Information Theory
Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach

IEEE Transactions on Information Theory
Efficient Serial Message-Passing Schedules for LDPC Decoding

IEEE Transactions on Information Theory
On iterative soft-decision decoding of linear binary block codes and product codes

IEEE Journal on Selected Areas in Communications

Efficiently encodable irregular QC-LDPC codes constructed from self-reciprocal generator polynomials of MDS codes

IEEE Communications Letters
Quasi-cyclic LDPC codes: an algebraic construction, rank analysis, and codes on Latin squares

IEEE Transactions on Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present an efficient systematic encoding algorithm for quasi-cyclic (QC) low-density parity-check (LDPC) codes that are related to cyclic maximum-distance separable (MDS) codes. The algorithm offers linear time complexity, and it can be easily implemented by using polynomial multiplication and division circuits. We show that the division polynomials can be completely characterized by their zeros and that the sum of the respective numbers of their zeros is equal to the parity-length of the codes.