Proximity gaps in interleaved codes

DOI10.62056/A0LJBKRZMaRDI QIDQ7326418zbMATH OpenFDO

Authors Benjamin E. Diamond, Angus Gruen

Publication date 9 September 2026

Published in IACR Communications in Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/A0LJBKRZ

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites work

• Algorithmic Results in List Decoding
• Brakedown: linear-time and field-agnostic SNARKs for R1CS
• Fast Reed-Solomon interactive oracle proofs of proximity
• Ligero: lightweight sublinear arguments without a trusted setup
• Proximity gaps for Reed-Solomon codes
• Proximity testing with logarithmic randomness

This page was built for publication: Proximity gaps in interleaved codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326418)