Incidence structures from the blown-up plane and LDPC codes

Details Incidence structures from the blown-up plane and LDPC codes Incidence structures from the blown-up plane and LDPC codes

2010-04-21

arxiv.org/abs/1004.3774v3

IEEE, Trans. Inform. Theory, volume 57(7), Pages 4401 - 4416, 2011

Computer Science

Information Theory

31 pages, 10 figures

Scientific paper

10.1109/TIT.2011.2146490

In this article, new regular incidence structures are presented. They arise from sets of conics in the affine plane blown-up at its rational points. The LDPC codes given by these incidence matrices are studied. These sparse incidence matrices turn out to be redundant, which means that their number of rows exceeds their rank. Such a feature is absent from random LDPC codes and is in general interesting for the efficiency of iterative decoding. The performance of some codes under iterative decoding is tested. Some of them turn out to perform better than regular Gallager codes having similar rate and row weight.

Affiliated with

Also associated with

No associations

Rating

Incidence structures from the blown-up plane and 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 Incidence structures from the blown-up plane and LDPC codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Incidence structures from the blown-up plane and LDPC codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-327623