LDPC Codes From Generalized Polygons
From MaRDI portal
Publication:3547306
DOI10.1109/TIT.2005.856936zbMATH Open1318.94112OpenAlexW2145244895MaRDI QIDQ3547306FDOQ3547306
Authors: Zhenyu Liu, Dimitrios A. Pados 
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2005.856936
Recommendations
- On LDPC codes corresponding to affine parts of generalized polygons
- scientific article; zbMATH DE number 4162811
- LDPC codes associated with linear representations of geometries
- Regular LDPC codes from semipartial geometries
- New Classes of Partial Geometries and Their Associated LDPC Codes
- LDPC codes generated by conics in the classical projective plane
- Linear representations of finite geometries and associated LDPC codes
- Lattice polytopes in coding theory
- Codes associated with generalized polygons
- Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking
Cited In (25)
- Moderate-density parity-check codes from projective bundles
- Codes associated with generalized polygons
- Recent Developments in Low-Density Parity-Check Codes
- Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking
- LDPC codes from \(\mu\)-geodetic graphs obtained from block designs
- On LDPC codes corresponding to affine parts of generalized polygons
- On codewords in the dual code of classical generalised quadrangles and classical polar spaces
- High stopping-distance LDPC product codes based on Hamming and finite geometry codes.
- Large weight code words in projective space codes
- A study of intersections of quadrics having applications on the small weight codewords of the functional codes \(C_2(Q)\), \(Q\) a non-singular quadric
- Explicit non-malleable codes from bipartite graphs
- Regular LDPC codes from semipartial geometries
- Title not available (Why is that?)
- Algebraic codes and geometry of some classical generalized polygons
- LDPC codes from triangle-free line sets
- High-Rate Quasi-Cyclic Low-Density Parity-Check Codes Derived From Finite Affine Planes
- Codes of Desarguesian projective planes of even order, projective triads and \((q+t,t)\)-arcs of type \((0, 2, t)\)
- Some low-density parity-check codes derived from finite geometries
- Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
- Two classes of LDPC codes from the space of Hermitian matrices over finite fields
- LDPC codes constructed from cubic symmetric graphs
- Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
- Small weight codewords in the LDPC codes arising from linear representations of geometries
- Graph-based convolutional and block LDPC codes
- Codes with girth 8 Tanner graph representation
This page was built for publication: LDPC Codes From Generalized Polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547306)
