On the dimensions of certain LDPC codes based on q-regular bipartite graphs

Details On the dimensions of certain LDPC codes based on q-regular bipartite graphs On the dimensions of certain LDPC codes based on q-regular bipartite graphs

2005-06-05

arxiv.org/abs/cs/0506011v3

IEEE Trans. Information Theory, 52 (8), (2006), 3735-3737

Computer Science

Information Theory

3 pages corrected typos: in inequality (2) changed a minus sign to plus v3.corrected 2 typos in Lemma 3.5 and added Journal-re

Scientific paper

An explicit construction of a family of binary LDPC codes called LU(3,q),
where q is a power of a prime, was recently given. A conjecture was made for
the dimensions of these codes when q is odd. The conjecture is proved in this
note. The proof involves the geometry of a 4-dimensional symplectic vector
space and the action of the symplectic group and its subgroups.

Affiliated with

Also associated with

No associations

Rating

On the dimensions of certain LDPC codes based on q-regular bipartite graphs 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 On the dimensions of certain LDPC codes based on q-regular bipartite graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the dimensions of certain LDPC codes based on q-regular bipartite graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-175121