Explicit Construction of Families of LDPC Codes With No<tex>4</tex>-Cycles
From MaRDI portal
Publication:3547154
DOI10.1109/TIT.2004.834760zbMATH Open1315.94140MaRDI QIDQ3547154FDOQ3547154
Authors: Jon-Lark Kim, Uri N. Peled, Irina Perepelitsa, V. Pless, S. Friedland 
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
Cited In (29)
- Moderate-density parity-check codes from projective bundles
- Recent Developments in Low-Density Parity-Check Codes
- Eigenvalues and expansion of bipartite graphs
- 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
- The dimensions of \(LU(3,q)\) codes
- Minimum distances of three families of low-density parity-check codes based on finite geometries
- Low density parity check lattices based on construction \(D'\) and cycle-free Tanner graphs
- On the conjecture for the girth of the bipartite graph \(D(k,q)\)
- On the girth of the bipartite graph \(D(k, q)\)
- Enumeration of \((0.1)\)-matrices avoiding some \(2 \times 2\) matrices
- Girth of the algebraic bipartite graph \(D(k,q)\)
- LDPC codes from triangle-free line sets
- On New Examples of Families of Multivariate Stable Maps and their Cryptographical Applications
- Linear representations of finite geometries and associated LDPC codes
- Constructions of QC LDPC codes based on integer sequences
- LDPC codes from cubic semisymmetric graphs
- On the key exchange and multivariate encryption with nonlinear polynomial maps of stable degree
- Some low-density parity-check codes derived from finite geometries
- Some combinatorial aspects of constructing bipartite-graph codes
- Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
- Two classes of LDPC codes from the space of Hermitian matrices over finite fields
- On the comparison of cryptographical properties of two different families of graphs with large cycle indicator
- On the girth cycles of the bipartite graph \(D(k, q)\)
- LDPC codes constructed from cubic symmetric graphs
- Performance of algebraic graphs based stream-ciphers using large finite fields
- On the Dimensions of Certain LDPC Codes Based on$q$-Regular Bipartite Graphs
- Small weight codewords in the LDPC codes arising from linear representations of geometries
- Codes with girth 8 Tanner graph representation
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)
