Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
From MaRDI portal
Recommendations
- Small weight codewords in the LDPC codes arising from linear representations of geometries
- Linear representations of finite geometries and associated LDPC codes
- LDPC codes associated with linear representations of geometries
- Some low-density parity-check codes derived from finite geometries
- LDPC Codes From Generalized Polygons
Cites work
- A recursive approach to low complexity codes
- Codes associated with generalized polygons
- Expander codes
- 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
- Explicit constructions of graphs without short cycles and low density codes
- Good error-correcting codes based on very sparse matrices
- 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 53569 (Why is no real title available?)
- LDPC Block and Convolutional Codes Based on Circulant Matrices
- LDPC Codes From Generalized Polygons
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
- Minimum-distance bounds by graph analysis
- On the Dimensions of Certain LDPC Codes Based on$q$-Regular Bipartite Graphs
- Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
Cited in
(17)- Some combinatorial aspects of constructing bipartite-graph codes
- Locally repairable codes with high availability based on generalised quadrangles
- 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
- The homogeneous pseudo-embeddings and hyperovals of the generalized quadrangle \(H(3,4)\)
- On LDPC codes corresponding to affine parts of generalized polygons
- Minimum distances of three families of low-density parity-check codes based on finite geometries
- A note on the minimum distance of quantum LDPC codes
- On the minimum distance of array codes as LDPC codes
- Small weight codewords in the LDPC codes arising from linear representations of geometries
- Large weight code words in projective space codes
- On the dual code of points and generators on the Hermitian variety \(\mathcal{H}(2n+1,q^2)\)
- 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
- On codewords in the dual code of classical generalised quadrangles and classical polar spaces
- 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
This page was built for publication: Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2383983)
