Some combinatorial aspects of constructing bipartite-graph codes
From MaRDI portal
Publication:1950398
DOI10.1007/s00373-011-1103-5zbMath1263.05018arXiv0909.5669OpenAlexW2119456579MaRDI QIDQ1950398
Fernanda Pambianco, Stefano Marcugini, Massimo Giulietti, Alexander A. Davydov
Publication date: 13 May 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0909.5669
LDPC codeslow-density parity-check codesconfigurations in combinatoricsprojective and affine spacesbipartite-graph codesgraphs without 4-cycles
Linear codes (general theory) (94B05) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of finite geometries (05B25)
Related Items
On constructions and parameters of symmetric configurations \(v_k\) ⋮ Twisted cubic and plane-line incidence matrix in \(\mathrm{PG}(3,q)\) ⋮ Further results on multiple coverings of the farthest-off points ⋮ Incidence matrices for the class \({\mathcal{O}}_6\) of lines external to the twisted cubic in \(\mathrm{PG}(3,q)\) ⋮ Twisted cubic and point-line incidence matrix in \(\operatorname{PG}(3,q)\) ⋮ On planes through points off the twisted cubic in \(\mathrm{PG}(3,q)\) and multiple covering codes ⋮ Multiple coverings of the farthest-off points with small density from projective geometry
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On codewords in the dual code of classical generalised quadrangles and classical polar spaces
- LDPC codes generated by conics in the classical projective plane
- Tactical (de-)compositions of symmetric configurations
- On sharply transitive sets in \(\mathrm{PG}(2,g)\).
- LDPC codes from triangle-free line sets
- Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
- Expander codes
- Distance properties of expander codes
- Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
- Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
- Codes on finite geometries
- LDPC Block and Convolutional Codes Based on Circulant Matrices
- Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking
- Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach
- New inductive constructions of complete caps inPG(N, q),qeven
- Small weight codewords in the LDPC codes arising from linear representations of geometries
- A recursive approach to low complexity codes
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
- Error exponents of expander codes
- Constructions of bipartite graphs from finite geometries
- Small complete caps in PG(N, q), q even
- Sets of type \((a,b)\) from subgroups of \(\Gamma L (1, p^R)\)
- Sets with few intersection numbers from Singer subgroup orbits
