Weight distribution bounds to relate minimum distance, list decoding, and symmetric channel performance
2026-04-06T08:51:44Z•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
What happened
Collection of recent arXiv submissions (06 Apr 2026) on coding, channel modeling, compression, and AI-enabled wireless systems. Key contributions include: (1) bounds relating weight distribution, minimum distance, list-decoding radius, and symmetric-channel error probability for general and linear q-ary codes (extends Pernice–Sprumont–Wootters results and improves Johnson-radius guarantees using erasure/weight-distribution techniques); (2) non-asymptotic bounds and a low-complexity posterior-matching encoder for variable-length feedback (VLF) over binary-input memoryless symmetric channels (BM
Why it matters
A reviewed impact interpretation has not been published for this record.
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.