Construction of codes over a commutative non-unital ring from simplicial complexes and their applications
2026-06-17T08:51:49Z•4d708bdd4c7bea076e71067634246963756102ce6566c68b9fbb16a3f0f2d8db
BCH-decoderFPGAISACJSCCPOMDPbenchmarkblind-recognitiondata-compressionerror-correcting-codeshardware-accelerationinformation-theorylocally-recoverable-codesover-the-air-federated-learningpolar-codesprivacyquantum-LDPCsecret-sharingsemantic-communicationsensing-nativewireless-forensics
What happened
This feed collects new research (arXiv, 17 Jun 2026) across coding theory, communications, compression, control, and learning. Key contributions: (1) Construction of linear codes over an extension of a commutative non-unital ring using simplicial-complex-derived defining sets; Gray-image and subfield-like codes producing divisible, minimal, optimal, and self-orthogonal codes, with applications to projective few-weight codes, locally-recoverable codes, secret-sharing access structures, and strongly regular graph constructions. (2) A hypothesis-testing framework for blind recognition of polar-c0
Why it matters
A reviewed impact interpretation has not been published for this record.
Evidence and limitations
- Source ID
- arxiv_math_it
- Record identifier
- 4d708bdd4c7bea076e71067634246963756102ce6566c68b9fbb16a3f0f2d8db
- Enrichment time
- 2026-06-17T08:51:49Z
- 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.