Linear representations of finite geometries and associated LDPC codes
Low density parity check (LDPC) codes are codes where the parity check matrix has few non-zero entries. These codes have been shown to be extremely important in coding theory due to the fact that they can often have maximal and near maximal minimum weights. The incidence system of affine points and lines in a subset of a finite projective space is a linear representation. The rank of this incidence matrix is shown to have a direct geometric interpretation in terms of hyperplanes. The authors construct LDPC codes using both the incidence matrix and its transpose as parity check matrices. They prove a conjecture of Vandendriessche, that using the incidence matrix as the parity check matrix, the code is generated by vectors of minimum weight. Using the transpose as the parity check matrix, they compute the minimum weight in some cases and give explicit constructions of minimum weight vectors.
- LDPC codes associated with linear representations of geometries
- Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
- Small weight codewords in the LDPC codes arising from linear representations of geometries
- LDPC codes from triangle-free line sets
- Some low-density parity-check codes derived from finite geometries
- A construction for infinite families of semisymmetric graphs revealing their full automorphism group
- Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
- Explicit construction of graphs with an arbitrary large girth and of large size
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- scientific article; zbMATH DE number 3877205 (Why is no real title available?)
- scientific article; zbMATH DE number 3356793 (Why is no real title available?)
- LDPC codes associated with linear representations of geometries
- Linear representations of subgeometries
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
- On a combinatorial generalization of 27 lines associated with a cubic surface
- On Algebraic Construction of Gallager and Circulant Low-Density Parity-Check Codes
- On the Dimensions of Certain LDPC Codes Based on$q$-Regular Bipartite Graphs
- On the spectrum of Wenger graphs
- Small weight codewords in the LDPC codes arising from linear representations of geometries
- Some low-density parity-check codes derived from finite geometries
- The isomorphism problem for linear representations and their graphs
- Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
- Geometric representations of linear codes
- Galois geometries and low-density parity-check codes
- LDPC Codes From Generalized Polygons
- Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking
- Small weight codewords in the LDPC codes arising from linear representations of geometries
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
- Local directed strongly regular graphs and LDPC codes based on projective geometry
- LDPC codes associated with linear representations of geometries
- Two classes of LDPC codes from the space of Hermitian matrices over finite fields
- Explicit non-malleable codes from bipartite graphs
- LDPC LCD codes from odd graphs
- LDPC codes generated by conics in the classical projective plane
- Regular LDPC codes from semipartial geometries
This page was built for publication: Linear representations of finite geometries and associated LDPC codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2306010)
