Paper 2016/369
Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex
Ronald Cramer, Chaoping Xing, and Chen Yuan
Abstract
Reed-Muller codes are among the most important classes of locally correctable codes. Currently local decoding of Reed-Muller codes is based on decoding on lines or quadratic curves to recover one single coordinate. To recover multiple Reed-Muller codes are among the most important classes of locally correctable codes. Currently local decoding of Reed-Muller codes is based on decoding on lines or quadratic curves to recover one single coordinate. To recover multiple coordinates simultaneously, the naive way is to repeat the local decoding for recovery of a single coordinate. This decoding algorithm might be more expensive, i.e., require higher query complexity. %Precisely speaking, to correct arbitrarily large number
Note: Current version will appear in IEEE Trans. Information Theory
Metadata
- Available format(s)
- Category
- Applications
- Publication info
- Preprint.
- Contact author(s)
- ych04 @ hotmail com
- History
- 2019-09-16: last of 5 revisions
- 2016-04-12: received
- See all versions
- Short URL
- https://ia.cr/2016/369
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2016/369, author = {Ronald Cramer and Chaoping Xing and Chen Yuan}, title = {Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex}, howpublished = {Cryptology {ePrint} Archive, Paper 2016/369}, year = {2016}, url = {https://eprint.iacr.org/2016/369} }