Reed-Muller type codes over a combinatorial simplex: an algebraic description
2026-06-03T08:51:42Z•16fc149d301b3fd3d63c5db1e72289180884a54a888d02bfafb18ae33abad9eb
CAP-codesESPAR','Mahalanobis-distance','single-RF'E_gamma-divergenceGroebner-basisJohnson-graphsLangevinMCMCMIMOMetropolis-HastingsNOMAOFDMOMAReed-Mulleranalog-codesantenna-designarxivcoding-theorycombinatoricserror-correcting-codeskissing-arrangementsmath_itmixing-timespinching-antennasrotatable-antennatraffic-offloading
What happened
RSS of new arXiv submissions (≈12 items, one truncated) across coding theory, information theory, wireless/antenna systems, MCMC/mixing theory, compression, and combinatorics. Highlights include: algebraic description of Reed–Muller–type (CAP) codes over combinatorial simplices with a universal Gröbner basis and weight formulae; bounds and constructions for single-error-correcting analog codes over R; contraction-based mixing-time bounds for MCMC (E_γ-divergence) and applications to projected Langevin and Metropolis–Hastings; comparison of NOMA vs OMA for rotatable-antenna systems; traffic off
Why it matters
A reviewed impact interpretation has not been published for this record.
Evidence and limitations
- Source ID
- arxiv_math_it
- Record identifier
- 16fc149d301b3fd3d63c5db1e72289180884a54a888d02bfafb18ae33abad9eb
- Enrichment time
- 2026-06-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.