On Coset Leader Graphs of LDPC Codes
From MaRDI portal
Abstract: Our main technical result is that, in the coset leader graph of a linear binary code of block length n, the metric balls spanned by constant-weight vectors grow exponentially slower than those in . Following the approach of Friedman and Tillich (2006), we use this fact to improve on the first linear programming bound on the rate of LDPC codes, as the function of their minimal distance. This improvement, combined with the techniques of Ben-Haim and Lytsin (2006), improves the rate vs distance bounds for LDPC codes in a significant sub-range of relative distances.
Recommendations
- On coset leader graphs of structured linear codes
- On the weight distribution of the coset leaders of constacyclic codes
- Computing coset leaders and leader codewords of binary codes
- LDPC codes based on algebraic graphs
- LDPC codes from cubic semisymmetric graphs
- The extended coset leader weight enumerator of a twisted cubic code
- scientific article; zbMATH DE number 2154511
- LDPC codes constructed from cubic symmetric graphs
- On the weight distribution of the coset leaders of the first-order Reed - Muller code (Corresp.)
- On the PAPR of cosets of linear codes
Cited in
(2)
This page was built for publication: On Coset Leader Graphs of LDPC Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977322)