On Coded Caching Systems with Decentralized Linear Coding Placement
2026-05-01T08:51:44Z•e21b16f482bcf0c40e4d02b88043395bc3b16ee9076da4140b337f0c3a364da8
Cover rankingISACISI mitigationSIGRegaggregationantenna mode assignmentbeamformingcoded cachingdecentralized placementeigenvalue boundsenumerative codinginformation bottlenecklinear programmingmolecular communicationnon-uniform arraysover-the-air computation (AirComp)perfect privacyprivacyrandom linear codingrate-distortionrun-length-limited (RLL) codesself-supervised learningsemidefinite programmingsum-rank metrictransmitter placement optimization','wireless planning','ray-tr
What happened
Collection of new arXiv submissions (May 1, 2026) across coding, communications, sensing, and learning. Highlights include: decentralized coded caching with random linear coding placement and matching achievable/converse bounds; enumerative, low-storage RLIM encoders/decoders for molecular communications; non-uniform flexible-antenna designs for monostatic ISAC and sum-rate optimization; a geometric/information‑theoretic treatment of encoder representations (Information Bottleneck → Gaussian relaxation / SIGReg) for self-supervised learning; SDP/LP spectral bounds for sum-rank-metric codes and
Why it matters
A reviewed impact interpretation has not been published for this record.
Evidence and limitations
- Source ID
- arxiv_math_it
- Record identifier
- e21b16f482bcf0c40e4d02b88043395bc3b16ee9076da4140b337f0c3a364da8
- Enrichment time
- 2026-05-01T08: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.