Quantum Hierarchical Locally Recoverable Codes
2026-06-08T08:51:44Z•cfb88e81d336e459ef816322cd32a8daeb77007c2d60a35b5b4660c20ba61466
AI-native communicationsAirCompCSS codesEnvironment-Division Multiple AccessFIMFlexible Intelligent MetasurfaceK-recursionMIMOQHLRCQLRCTamo–BargTyler's M-estimatorautomatic differentiationdegrees of freedomduplication channelsinformation ratemutual information optimizationnanopore sequencingover-the-air computationquantum error correctionquantum storagereconfigurable intelligent surfacerobust statisticsrobust subspace recoverysparse covariance estimation','vertical-split model','minimax','
What happened
Feed of new arXiv submissions (math.IT / information theory) dated 2026-06-08. Key items:
- "Quantum Hierarchical Locally Recoverable Codes": introduces (r,δ) quantum locally recoverable codes (QLRCs), explicit/random constructions (quantum Tamo–Barg families), decoding algorithm, and h-level hierarchical QHLRCs with a Singleton-like bound via CSS/dual-containing codes.
- "Degrees of Freedom of Over-the-Air Computation over a MIMO Gaussian Network with Two Transmitters and Two Receivers": defines AirComp degrees-of-freedom (ACDoF) for 2×2 MIMO aggregation, gives almost-sure ACDoF formula and S
Why it matters
A reviewed impact interpretation has not been published for this record.
Evidence and limitations
- Source ID
- arxiv_math_it
- Record identifier
- cfb88e81d336e459ef816322cd32a8daeb77007c2d60a35b5b4660c20ba61466
- Enrichment time
- 2026-06-08T08: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.