Some combinatorial aspects of constructing bipartite-graph codes
From MaRDI portal
Publication:1950398
Abstract: We propose geometrical methods for constructing square 01-matrices with the same number n of units in every row and column, and such that any two rows of the matrix contain at most one unit in common. These matrices are equivalent to n-regular bipartite graphs without 4-cycles, and therefore can be used for the construction of efficient bipartite-graph codes such that both the classes of its vertices are associated with local constraints. We significantly extend the region of parameters m,n for which there exist an n-regular bipartite graph with 2m vertices and without 4-cycles. In that way we essentially increase the region of lengths and rates of the corresponding bipartite-graph codes. Many new matrices are either circulant or consist of circulant submatrices: this provides code parity-check matrices consisting of circulant submatrices, and hence quasi-cyclic bipartite-graph codes with simple implementation.
Recommendations
Cites work
- A recursive approach to low complexity codes
- Codes on finite geometries
- Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach
- Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking
- Constructions of bipartite graphs from finite geometries
- Distance properties of expander codes
- Error control coding. Fundamentals and applications
- Error exponents of expander codes
- Expander codes
- Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
- scientific article; zbMATH DE number 5722251 (Why is no real title available?)
- scientific article; zbMATH DE number 26311 (Why is no real title available?)
- scientific article; zbMATH DE number 140059 (Why is no real title available?)
- scientific article; zbMATH DE number 1101474 (Why is no real title available?)
- scientific article; zbMATH DE number 3251924 (Why is no real title available?)
- scientific article; zbMATH DE number 3257050 (Why is no real title available?)
- LDPC Block and Convolutional Codes Based on Circulant Matrices
- LDPC codes from triangle-free line sets
- LDPC codes generated by conics in the classical projective plane
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
- New inductive constructions of complete caps in \(\mathrm{PG}(N, q)\), \(q\) even
- On (minimal) regular graphs of girth \(6\)
- On codewords in the dual code of classical generalised quadrangles and classical polar spaces
- On geometric constructions of \((k,g)\)-graphs
- On sharply transitive sets in \(\mathrm{PG}(2,g)\).
- Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
- Sets of type \((a,b)\) from subgroups of \(\Gamma L (1, p^R)\)
- Sets with few intersection numbers from Singer subgroup orbits
- Small complete caps in PG(N, q), q even
- Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
- Small weight codewords in the LDPC codes arising from linear representations of geometries
- Tactical (de-)compositions of symmetric configurations
- The CRC handbook of combinatorial designs
Cited in
(13)- Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
- 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
- Twisted cubic and plane-line incidence matrix in \(\mathrm{PG}(3,q)\)
- Twisted cubic and point-line incidence matrix in \(\operatorname{PG}(3,q)\)
- Bounds on codes derived by counting components in Varshamov graphs
- Constructions of binary codes based on bipartite graphs
- On constructions and parameters of symmetric configurations \(v_k\)
- Further results on multiple coverings of the farthest-off points
- scientific article; zbMATH DE number 5300021 (Why is no real title available?)
- Bi-resolving graph homomorphisms and extensions of bi-closing codes
- Incidence matrices for the class \({\mathcal{O}}_6\) of lines external to the twisted cubic in \(\mathrm{PG}(3,q)\)
- Discriminating codes in (bipartite) planar graphs
This page was built for publication: Some combinatorial aspects of constructing bipartite-graph codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1950398)
