On the Dimensions of Certain LDPC Codes Based on -Regular Bipartite Graphs
Sin, P.
Qing Xiang
Dept. of Math., Florida Univ., Gainesville, FL;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: Aug. 2006
Volume: 52,
Issue: 8
On page(s): 3735-3737
ISSN: 0018-9448
INSPEC Accession Number: 9010879
Digital Object Identifier: 10.1109/TIT.2006.878231
Current Version Published: 2006-07-24
Abstract
An explicit construction of a family of binary low-density parity check (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 four-dimensional (4-D) symplectic vector space and the action of the symplectic group and its subgroups
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
-Regular Bipartite Graphs
