DocumentCode :
1051497
Title :
On the Dimensions of Certain LDPC Codes Based on 
-Regular Bipartite Graphs
-Regular Bipartite GraphsAuthor :
Sin, Peter ; Xiang, Qing
Author_Institution :
Dept. of Math., Florida Univ., Gainesville, FL
Volume :
52
Issue :
8
fYear :
2006
Firstpage :
3735
Lastpage :
3737
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
Keywords :
binary codes; graph theory; parity check codes; binary LDPC codes; four-dimensional symplectic vector space; low-density parity check codes; q-regular bipartite graph; Bipartite graph; Geometry; Mathematics; Parity check codes; Silicon compounds; Two dimensional displays; Vectors; Generalized quadrangle; incidence matrix; low-density parity check (LDPC) code; symplectic grou;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2006.878231
Filename :
1661850
Link To Document :
