When Relaxation Does Not Help: RLDCs with Small Soundness Yield LDCs
2026-03-05T13:38:35Z•0710ca6b9b5d39c821c95c3659a6224619f7bb92370e780770db8e62f25d2ab1
Goppa codes','differential Goppa codes','algebraic‑geometry','stLCCLDCMIMOPCPPRLCCRLDCReed‑Solomonanalog error correctionarXivbeamformingcell‑free massive MIMOcoding theorycrossbardiffusion modelsfederated learninggeometric codesin‑memory computinglist decodinglocally decodable codesnoisy labelspositioning‑assisted beamformingprecodingrate‑distortion‑perceptionrobust learning
What happened
This document is an arXiv feed (math/IT) containing multiple new and updated submissions (Mar 5, 2026) across coding theory, communications, learning, and signal processing. Highlights include: a theoretical result showing that q‑query relaxed locally decodable codes (RLDCs) with sufficiently small soundness yield standard q‑query LDCs (extending prior linear-code results and implying new lower bounds for RLDCs/RLCCs and PCPPs); a geometric family of analog error‑correction codes for resistive crossbar in‑memory computing (handling multiple outliers); constructions of linear codes from simplic
Why it matters
A reviewed impact interpretation has not been published for this record.
Evidence and limitations
- Source ID
- arxiv_math_it
- Record identifier
- 0710ca6b9b5d39c821c95c3659a6224619f7bb92370e780770db8e62f25d2ab1
- Enrichment time
- 2026-03-05T13:38:35Z
- 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.