A new framework with coset-weight generating functions and local growth analysis improves upper bounds on the rate-distance tradeoff for LDPC codes beyond prior work.
Distance distributions in ensembles of irregular low-density parity-check codes.IEEE Transactions on Information Theory, 49(12):3140–3159
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Improved Rate-versus-Distance Upper Bounds for LDPC Codes
A new framework with coset-weight generating functions and local growth analysis improves upper bounds on the rate-distance tradeoff for LDPC codes beyond prior work.