Explicit Construction of Families of LDPC Codes With No<tex>4</tex>-Cycles
From MaRDI portal
Publication:3547154
Recommendations
Cited in
(29)- Some low-density parity-check codes derived from finite geometries
- On the Dimensions of Certain LDPC Codes Based on$q$-Regular Bipartite Graphs
- Recent Developments in Low-Density Parity-Check Codes
- Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
- Girth of the algebraic bipartite graph \(D(k,q)\)
- LDPC codes from triangle-free line sets
- Minimum distances of three families of low-density parity-check codes based on finite geometries
- Two classes of LDPC codes from the space of Hermitian matrices over finite fields
- LDPC codes from cubic semisymmetric graphs
- On new examples of families of multivariate stable maps and their cryptographical applications
- Small weight codewords in the LDPC codes arising from linear representations of geometries
- Linear representations of finite geometries and associated LDPC codes
- LDPC codes constructed from cubic symmetric graphs
- Enumeration of \((0.1)\)-matrices avoiding some \(2 \times 2\) matrices
- On the comparison of cryptographical properties of two different families of graphs with large cycle indicator
- Low density parity check lattices based on construction \(D'\) and cycle-free Tanner graphs
- Constructions of QC LDPC codes based on integer sequences
- Eigenvalues and expansion of bipartite graphs
- On the girth of the bipartite graph \(D(k, q)\)
- Performance of algebraic graphs based stream-ciphers using large finite fields
- Codes with girth 8 Tanner graph representation
- On the girth cycles of the bipartite graph \(D(k, q)\)
- The dimensions of \(LU(3,q)\) codes
- Moderate-density parity-check codes from projective bundles
- Dynamical systems as the main instrument for the constructions of new quadratic families and their usage in cryptography
- On the key expansion of \(D(n, K)\)-based cryptographical algorithm
- Some combinatorial aspects of constructing bipartite-graph codes
- On the conjecture for the girth of the bipartite graph \(D(k,q)\)
- On the key exchange and multivariate encryption with nonlinear polynomial maps of stable degree
This page was built for publication: Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547154)
