GF(2^m) Low-Density Parity-Check Codes Derived from Cyclotomic Cosets

Details GF(2^m) Low-Density Parity-Check Codes Derived from Cyclotomic Cosets GF(2^m) Low-Density Parity-Check Codes Derived from Cyclotomic Cosets

2005-02-07

arxiv.org/abs/cs/0502037v2

Computer Science

Information Theory

Coding

Scientific paper

Based on the ideas of cyclotomic cosets, idempotents and Mattson-Solomon polynomials, we present a new method to construct GF(2^m), where m>0 cyclic low-density parity-check 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.

Affiliated with

Also associated with

No associations

Rating

GF(2^m) Low-Density Parity-Check Codes Derived from Cyclotomic Cosets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with GF(2^m) Low-Density Parity-Check Codes Derived from Cyclotomic Cosets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and GF(2^m) Low-Density Parity-Check Codes Derived from Cyclotomic Cosets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-129090