On the structure of constacyclic codes over finite chain rings
2026-07-03T08:51:42Z•18288b4e5afa532421a013b7c85d031c9d6ea1e9ed499a51d7f1d8b971a44ff1
EAQECCGalois-connectionK-SATMDSMHDRReed-MullerSIC-POVMVQ-VAEcoding-theorycomplexity-theoryconstacyclic-codesentanglement-assisted-quantum-codesexpander-autoencodersfinite-chain-ringsgeneralized-rank-weighthybrid-beamforminglow-latency-communicationsmaximal-quantum-leakagemechanistic-interpretabilityopportunistic-spectrum-accessquantum-encodingsparse-codingsparse-phase-shifterweight-distribution
What happened
Collection of arXiv preprints (published 2026-07-03) across coding theory, communications, quantum information, complexity, and ML. Highlights include: an explicit minimal-generator construction for λ-constacyclic codes over finite chain rings with MHDR/MDS criteria; a VQ-VAE–based low-latency, task-oriented image transmission scheme over opportunistic spectrum access; generalized extended codes yielding many new entanglement-assisted qubit/qutrit codes; the exact weight distribution of the third-order Reed–Muller code RM(3,11); a Galois-connection treatment of generalized rank and poset-based
Why it matters
A reviewed impact interpretation has not been published for this record.
Evidence and limitations
- Source ID
- arxiv_math_it
- Record identifier
- 18288b4e5afa532421a013b7c85d031c9d6ea1e9ed499a51d7f1d8b971a44ff1
- Enrichment time
- 2026-07-03T08:51:42Z
- 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.