The Extremum Stack is a Minimal Sufficient Statistic for Rate-Independent Functionals: A Kolmogorov Complexity Characterisation
2026-05-20T08:51:40Z•400ebcc5152083f60e3009791ccf2c118f3effa1dc658ac4e413ef07a234232c
CSIChase-decodingDNA-storageKolmogorov-complexityMIMOXRarXivchannel-estimationcoding-theorycommunicationsdiffusion-modelsfoundation-modelshypothesis-testinghysteresisinformation-theorymachine-learningpointwise-maximal-leakageprivacyrank-modulationroboticssequence-designsoft-coveringtensor-decompositiontime-series-compressionwireless
What happened
RSS feed (arXiv math/IT) dated 2026-05-20 containing 13 new preprints across information theory, coding, communications, and related ML-methods. Highlights: a Kolmogorov-complexity characterization showing the extremum stack is a minimal sufficient statistic for rate‑independent functionals; a variational diffusion-based, computation‑efficient channel decoder; mode‑tensorized CP decomposition for improved MIMO channel estimation; deletion/insertion coding for rank‑modulated composite DNA storage; a new 13-valued cross‑correlation sequence result; sim‑to‑real communication‑rate optimization for
Why it matters
A reviewed impact interpretation has not been published for this record.
Evidence and limitations
- Source ID
- arxiv_math_it
- Record identifier
- 400ebcc5152083f60e3009791ccf2c118f3effa1dc658ac4e413ef07a234232c
- Enrichment time
- 2026-05-20T08:51:40Z
- 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.