On the dimensions of certain LDPC codes based on q-regular bipartite graphs
classification
💻 cs.IT
cs.DMmath.IT
keywords
codesconjecturedimensionsldpcsymplecticactionbinarybipartite
read the original abstract
An 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.