The dimensions of LU(3,q) codes

From MaRDI portal
Publication:1024994

DOI10.1016/J.JCTA.2008.12.007zbMATH Open1169.94015arXiv0802.0015OpenAlexW2962829797MaRDI QIDQ1024994FDOQ1024994

Ogul Arslan

Publication date: 18 June 2009

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/0802.0015




Recommendations




Cites Work


Cited In (3)





This page was built for publication: The dimensions of \(LU(3,q)\) codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024994)