Weight distribution bounds to relate minimum distance, list decoding, and symmetric channel performance
arXiv 2604.02994•28ffe67520739477bb9fce53756ab3b01167863724ee8cd5111d6e1b921ae83c
AWGNBMS channelsGaussian fadingGilbert-ElliottJohnson radiusOwen's T-functionbinary linear codingchannel modelingcharacteristic setserasure channelserror-correcting codesfull-rank conditionshigh-dimensional compressionlattice point boundslinear codeslist decodingmetric entropyminimum distancenon-asymptotic boundsposterior matchingrenewal theorysymbolic matricessymmetric channelvariable-length feedbackweight distribution
Paper metadata
- arXiv ID
- 2604.02994
- Version
- Not specified by this published record
- Category
- Mathematics — Information Theory (math.IT)
The PDF link points to arxiv.org. Baitaphish does not expose a private stored PDF.
Evidence and limitations
- Source ID
- arxiv_math_it
- Record identifier
- 28ffe67520739477bb9fce53756ab3b01167863724ee8cd5111d6e1b921ae83c
- Enrichment time
- 2026-04-06T08:51:44Z
- AI-assisted enrichment
- Yes
This record may overlap with other records. Its enrichment can be incomplete or wrong, and machine assistance was used. Validate consequential decisions against the linked source and your own environment.