LDPC codes associated with linear representations of geometries
Low density parity check matrices, introduced by \textit{R. G. Gallager} [IRE Trans. Inform. Theory IT-8, 21--28 (1962; Zbl 0107.11802)], are codes whose parity check matrices have a small percentage of nonzero elements. These codes have received a great deal of attention recently because they often outperform other codes and sometimes are very near the Shannon bound. The author examines LDPC codes over a field \(K\) constructed from finite geometries \(T^*_2({\mathcal K})\), where \({\mathcal K}\) is any subset of \(PG(2,q)\), \(q=p^h\), \(p \neq \text{char}(K).\) To define \(T^*_2({\mathcal K})\) let \(\Pi\) be a hyperplane in 3-dimensional projective space over \(F_q\). In \(T^*_2({\mathcal K})\), the points are the points of \(PG(3,q) \setminus PG(2,q)\), the lines are the affine lines which are incident with a point of \({\mathcal K}\) and the incidence relation is that of the ambient space. Examples include \(LU(3,q)^D\), the generalized quadrangle \(T^*_2({\mathcal K})\) with \({\mathcal K}\) a hyperoval, the affine space \(AG(3,q)\), and several partial and semi-partial geometries. The author gives a general setting for this study and provides a unified approach to previous results. In particular, he proves an expression for the dimension and minimum weight of the code, classifies code words of minimum weight, and proves that the code is generated by words of minimum weight.
- Some low-density parity-check codes derived from finite geometries
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
- Linear representations of finite geometries and associated LDPC codes
- scientific article; zbMATH DE number 2063211
- On Algebraic Construction of Gallager and Circulant Low-Density Parity-Check Codes
- Classes of codes from quadratic surfaces of PG(3,q)
- Galois geometries and low-density parity-check codes
- LDPC codes generated by conics in the classical projective plane
- Small weight codewords in the LDPC codes arising from linear representations of geometries
- LDPC codes from Singer cycles
- A family of low density matrices in Lagrangian-Grassmannian
- Absorbing set analysis of codes from affine planes
- LDPC codes from \(\mu\)-geodetic graphs obtained from block designs
- LDPC codes from triangle-free line sets
- Moderate-density parity-check codes from projective bundles
- Some low-density parity-check codes derived from finite geometries
- Linear representations of finite geometries and associated LDPC codes
- Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
- On LDPC codes corresponding to affine parts of generalized polygons
- Geometric representations of linear codes
- Minimum distances of three families of low-density parity-check codes based on finite geometries
- Galois geometries and low-density parity-check codes
- LDPC Codes From Generalized Polygons
- Codes on finite geometries
- On the Dimensions of Certain LDPC Codes Based on$q$-Regular Bipartite Graphs
- Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking
- scientific article; zbMATH DE number 5722251 (Why is no real title available?)
- Small weight codewords in the LDPC codes arising from linear representations of geometries
- Large weight code words in projective space codes
- scientific article; zbMATH DE number 2063211 (Why is no real title available?)
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
- On the dual code of points and generators on the Hermitian variety \(\mathcal{H}(2n+1,q^2)\)
- Local directed strongly regular graphs and LDPC codes based on projective geometry
- Codes of Desarguesian projective planes of even order, projective triads and \((q+t,t)\)-arcs of type \((0, 2, t)\)
- 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: LDPC codes associated with linear representations of geometries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540387)