LDPC codes from triangle-free line sets

DOI10.1023/B:DESI.0000029233.20866.41MaRDI QIDQ1877365zbMATH OpenOpenAlexFDO

Authors Keith E. Mellinger

Publication date 16 August 2004

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:desi.0000029233.20866.41

zbMATH Keywords

cappolarity

Mathematics Subject Classification ID

Paths and cycles (05C38) Combinatorial structures in finite projective spaces (51E20) Linear codes and caps in Galois spaces (51E22) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Review text

Let \(AG(n,q)\) and \(PG(n,q)\) be the finite affine and projective spaces respectively of dimension \(n\) over \(GF(q)\). A subset \(\mathcal L\) of lines of \(AG(n,q)\) or \(PG(n,q)\) is said to be triangle-free if no three nonconcurrent lines of \(\mathcal L\) form a triangle. If \(G\) is the bipartite graph whose vertices are the points of a finite space and whose edges are determined by natural inclusion, then the point-line graph associated with a triangle-free set turns out to have no cycles of length \(6\) and girth at least \(8\). It follows that the associated incidence matrix is relatively sparse and so can be used to construct a so-called low-density parity check code. In the paper under review the author gives two constructions of triangle-free sets and hence the parameters of the associated codes when \(q\) is sufficiently small.

Recommendations

• LDPC codes associated with linear representations of geometries
• LDPC codes from Singer cycles
• Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
• LDPC Codes From Generalized Polygons
• Galois geometries and low-density parity-check codes

Cited in

(12)

• Some combinatorial aspects of constructing bipartite-graph codes
• On the search of smallest QC-LDPC code with girth six and eight
• Construction of LDPC convolutional codes via difference triangle sets
• Construction of girth-8 \textit{(3,L)}-QC-LDPC codes of smallest CPM size using column multipliers
• Linear representations of finite geometries and associated LDPC codes
• On LDPC codes corresponding to affine parts of generalized polygons
• A note on the Turán function of even cycles
• Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
• Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity
• On the Smallest Absorbing Sets of LDPC Codes From Finite Planes
• Extremal numbers of hypergraph suspensions of even cycles
• LDPC codes generated by conics in the classical projective plane

Describes a project that uses

Uses Software

• Magma

This page was built for publication: LDPC codes from triangle-free line sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1877365)