Paper 2024/1351
Proximity Gaps in Interleaved Codes
Abstract
A linear error-correcting code exhibits proximity gaps if each affine line of words either consists entirely of words which are close to the code or else contains almost no such words. In this short note, we prove that for each linear code which exhibits proximity gaps within the unique decoding radius, that code's interleaved code also does. Combining our result with a recent argument of Angeris, Evans and Roh ('24), we extend those authors' sharpening of the tensor-based proximity gap of Diamond and Posen (Commun. Cryptol. '24) up to the unique decoding radius, at least in the Reed–Solomon setting.
Note: Final published version (only typeset differently).
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A minor revision of an IACR publication in CIC 2025
- DOI
- 10.62056/a0ljbkrz
- Contact author(s)
-
bdiamond @ irreducible com
agruen @ polygon technology - History
- 2025-01-13: revised
- 2024-08-28: received
- See all versions
- Short URL
- https://ia.cr/2024/1351
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1351,
author = {Benjamin E. Diamond and Angus Gruen},
title = {Proximity Gaps in Interleaved Codes},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1351},
year = {2024},
doi = {10.62056/a0ljbkrz},
url = {https://eprint.iacr.org/2024/1351}
}
