Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
Designs, Codes and Cryptography
IEEE Transactions on Information Theory - Part 1
Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory
Low-density parity-check codes based on finite geometries: a rediscovery and new results
IEEE Transactions on Information Theory
Quasicyclic low-density parity-check codes from circulant permutation matrices
IEEE Transactions on Information Theory
Explicit construction of families of LDPC codes with no 4-cycles
IEEE Transactions on Information Theory
LDPC block and convolutional codes based on circulant matrices
IEEE Transactions on Information Theory
LDPC codes from generalized polygons
IEEE Transactions on Information Theory
On the Dimensions of Certain LDPC Codes Based on -Regular Bipartite Graphs
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We look at low-density parity-check codes over a finite field $${\mathbb{K}}$$ associated with finite geometries $${T_2^*(\mathcal{K})}$$ , where $${\mathcal{K}}$$ is a sufficiently large k-arc in PG(2, q), with q = p h . The code words of minimum weight are known. With exception of some choices of the characteristic of $${\mathbb{K}}$$ we compute the dimension of the code and show that the code is generated completely by its code words of minimum weight.