Extends list-decoding-to-symmetric-channel links to general codes and tightens the minimum-distance bound for linear codes via weight-distribution analysis up to the Johnson radius.
Reed-- M uller codes have vanishing bit-error probability below capacity: a simple tighter proof via camellia boosting
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Weight distribution bounds to relate minimum distance, list decoding, and symmetric channel performance
Extends list-decoding-to-symmetric-channel links to general codes and tightens the minimum-distance bound for linear codes via weight-distribution analysis up to the Johnson radius.