Galois geometries and low-density parity-check codes
From MaRDI portal
Publication:3464682
zbMATH Open1361.94052MaRDI QIDQ3464682FDOQ3464682
Authors: Marcus Greferath, Leo Storme, Cornelia Rößing
Publication date: 27 January 2016
Recommendations
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
- scientific article; zbMATH DE number 2063211
- LDPC codes associated with linear representations of geometries
- Geometric constructions of Gallager codes
- Linear representations of finite geometries and associated LDPC codes
sparse matriceslow-density parity-check codespartial linear spaces\((0,1)\)-geometriesinversive spacestriangle free geometries
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20) Linear codes (general theory) (94B05) Decoding (94B35)
Cited In (10)
- Title not available (Why is that?)
- Low-rank parity-check codes over Galois rings
- Minimum distances of three families of low-density parity-check codes based on finite geometries
- LDPC codes associated with linear representations of geometries
- LDPC codes from triangle-free line sets
- LDPC codes from Singer cycles
- LDPC codes from cubic semisymmetric graphs
- LDPC codes constructed from cubic symmetric graphs
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
- Information geometry and low density parity check codes
This page was built for publication: Galois geometries and low-density parity-check codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3464682)