Finite-Blocklength Lossy Joint Source-Channel Coding over Unknown Channels
2026-06-09T08:51:43Z•d176b6879d08d440f5c32b54df76dc0d5ff91f008553daefb9d87460d633865d
Bayesian-decision-theoryMIMO-channel-modelsMaxwellian-random-fieldsRKHSZ4-codesarray-processingarxivasynchronous-receptioncell-free-massive-mimocyclic-codesfinite-blocklengthflexible-coupler-antennafluid-antenna-systemshypothesis-testinginformation-theoryjoint-source-channel-codingmechanical-beamformingmismatched-decodingnegacyclic-codesnumber-theoryoptical-IRSsoft-coveringsuperdirectivitytwin-prime-analysisvisible-light-communication
What happened
This document is an arXiv RSS batch (multiple new submissions) spanning information theory, communications, antenna/MIMO modeling, coding theory, and number-theory-inspired information analysis. Key items: (1) Finite-blocklength lossy joint source–channel coding over unknown channels — achievability bounds for mismatched-design JSCC, rate-dispersion results and universal codes for block erasure channels. (2) Fluid Antenna Systems (FAS) for cell-free massive MIMO — mitigates asynchronous reception via spatial reconfigurability and joint position/power optimization. (3) Soft covering via Neyman–
Why it matters
A reviewed impact interpretation has not been published for this record.
Evidence and limitations
- Source ID
- arxiv_math_it
- Record identifier
- d176b6879d08d440f5c32b54df76dc0d5ff91f008553daefb9d87460d633865d
- Enrichment time
- 2026-06-09T08:51:43Z
- 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.