Idempotents, Mattson-Solomon Polynomials and Binary LDPC codes

Details Idempotents, Mattson-Solomon Polynomials and Binary LDPC codes Idempotents, Mattson-Solomon Polynomials and Binary LDPC codes

2005-02-04

arxiv.org/abs/cs/0502024v1

Computer Science

Information Theory

9 pages, 3 figures

Scientific paper

We show how to construct an algorithm to search for binary idempotents which
may be used to construct binary LDPC codes. The algorithm, which allows control
of the key properties of sparseness, code rate and minimum distance, is
constructed in the Mattson-Solomon domain. Some of the new codes, found by
using this technique, are displayed.

Affiliated with

Also associated with

No associations

Rating

Idempotents, Mattson-Solomon Polynomials and Binary LDPC codes 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 Idempotents, Mattson-Solomon Polynomials and Binary LDPC codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Idempotents, Mattson-Solomon Polynomials and Binary LDPC codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-527981