Ogul Arslan
Published 2008-01-31, updated 2012-01-10Version 8
A family of LDPC codes, called LU(3,q) codes, has been constructed from q-regular bipartite graphs. Recently, P. Sin and Q. Xiang determined the dimensions of these codes in the case that q is a power of an odd prime. They also obtained a lower bound for the dimension of an LU(3,q) code when q is a power of 2. In this paper we prove that this lower bound is the exact dimension of the LU(3,q) code. The proof involves the geometry of symplectic generalized quadrangles, the representation theory of Sp(4,q), and the ring of polynomials.
Comments: The missing elements in the base $/beta$ are added. Typo in the proof of Lemma 10 is corrected
Journal: Journal of Combinatorial Theory, Series A 116 (2009) 1073-1079
On the number of 1-perfect binary codes: a lower bound
A Lower Bound for the Circumference Involving Connectivity
New lower bounds for the number of blocks in balanced incomplete block designs
![QR code for arXiv:0802.0015 [math.CO]](http://oss.arxitics.com/images/favicon.svg)