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

Simple item page
dc.creatorSin, Peter
dc.creatorXiang, Qing
dc.date2005-06-05
dc.date2007-12-04
dc.date.accessioned2026-07-07T08:46:59Z
dc.date.available2026-07-07T08:46:59Z
dc.descriptionAn 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.
dc.description3 pages corrected typos: in inequality (2) changed a minus sign to plus v3.corrected 2 typos in Lemma 3.5 and added Journal-ref
dc.identifierhttps://arxiv.org/abs/cs/0506011
dc.identifierhttp://arxiv.org/abs/cs/0506011
dc.identifierIEEE Trans. Information Theory, 52 (8), (2006), 3735-3737
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/143444
dc.subjectInformation Theory
dc.subjectDiscrete Mathematics
dc.subjectE.4
dc.titleOn the dimensions of certain LDPC codes based on q-regular bipartite graphs
dc.typetext

Files

Collections

arXiv