Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
From MaRDI portal
Publication:3547154
DOI10.1109/TIT.2004.834760zbMath1315.94140MaRDI QIDQ3547154
Uri N. Peled, Jon-Lark Kim, Irina Perepelitsa, Shmuel Friedland, Vera S. Pless
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items
Minimum distances of three families of low-density parity-check codes based on finite geometries, On the conjecture for the girth of the bipartite graph \(D(k,q)\), Codes with girth 8 Tanner graph representation, Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles, LDPC codes from cubic semisymmetric graphs, Recent Developments in Low-Density Parity-Check Codes, On the girth of the bipartite graph \(D(k, q)\), Girth of the algebraic bipartite graph \(D(k,q)\), Constructions of QC LDPC codes based on integer sequences, On the girth cycles of the bipartite graph \(D(k, q)\), Two classes of LDPC codes from the space of Hermitian matrices over finite fields, On New Examples of Families of Multivariate Stable Maps and their Cryptographical Applications, On the comparison of cryptographical properties of two different families of graphs with large cycle indicator, Some combinatorial aspects of constructing bipartite-graph codes, Enumeration of \((0.1)\)-matrices avoiding some \(2 \times 2\) matrices, Performance of algebraic graphs based stream-ciphers using large finite fields, On the key expansion of \(D(n, K)\)-based cryptographical algorithm, Dynamical systems as the main instrument for the constructions of new quadratic families and their usage in cryptography, Eigenvalues and expansion of bipartite graphs, Some low-density parity-check codes derived from finite geometries, Small weight codewords in the LDPC codes arising from linear representations of geometries, Linear representations of finite geometries and associated LDPC codes, The dimensions of \(LU(3,q)\) codes, LDPC codes constructed from cubic symmetric graphs, On the key exchange and multivariate encryption with nonlinear polynomial maps of stable degree, Moderate-density parity-check codes from projective bundles
