GF(2) Low-Density Parity-Check Codes Derived from Cyclotomic Cosets
نویسنده
چکیده
Based on the ideas of cyclotomic cosets, idempotents and Mattson-Solomon polynomials, we present a new method to construct GF(2m ), where m > 0 cyclic low-density paritycheck codes. The construction method produces the dual code idempotent which is used to define the parity-check matrix of the low-density parity-check code. An interesting feature of this construction method is the ability to increment the code dimension by adding more idempotents and so steadily decrease the sparseness of the parity-check matrix. We show that the constructed codes can achieve performance very close to the sphere-packing-bound constrained for binary transmission.
منابع مشابه
GF(2m) Low-Density Parity-Check Codes Derived from Cyclotomic Cosets
Based on the ideas of cyclotomic cosets, idempotents and Mattson-Solomon polynomials, we present a new method to construct GF(2m ), where m > 0 cyclic low-density paritycheck codes. The construction method produces the dual code idempotent which is used to define the parity-check matrix of the low-density parity-check code. An interesting feature of this construction method is the ability to in...
متن کاملFamilies of LDPC Codes Derived from Nonprimitive BCH Codes and Cyclotomic Cosets
Low-density parity check (LDPC) codes are an important class of codes with many applications. Two algebraic methods for constructing regular LDPC codes are derived – one based on nonprimitive narrow-sense BCH codes and the other directly based on cyclotomic cosets. The constructed codes have high rates and are free of cycles of length four; consequently, they can be decoded using standard itera...
متن کاملModerate-Density Parity-Check Codes
We propose a new type of short to moderate block-length, linear error-correcting codes, called moderate-density parity-check (MDPC) codes. The number of one’s of the parity-check matrix of the codes presented is typically higher than the number of one’s of the parity-check matrix of low-density paritycheck (LDPC) codes. But, still lower than those of the parity-check matrix of classical block c...
متن کاملOn two probabilistic decoding algorithms for binary linear codes
A generalization of Sullivan inequality on the ratio of the probability of a linear code to that of any of its cosets is proved. Starting from this inequality, a sufficient condition for successful decoding of linear codes by a probabilistic method is derived. A probabilistic decoding algorithm for “low–density parity–check codes” is also analyzed. The results obtained allow one to estimate exp...
متن کاملFPGA Implementations of LDPC over GF(2m) Decoders
Low Density Parity Check (LDPC) codes over GF(2) are an extension of binary LDPC codes that have not been studied extensively. Performances of GF(2) LDPC codes have been shown to be higher than binary LDPC codes, but the complexity of the encoders/decoders increases. Hence there is a substantial lack of hardware implementations for LDPC over GF(2) codes. This paper presents a FPGA serial implem...
متن کامل