Generic Reed-Solomon Codes Achieve List-Decoding Capacity-Reference-Cited by-同舟云学术

Generic Reed-Solomon Codes Achieve List-Decoding Capacity

Published:2023-06-02 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 55th Annual ACM Symposium on Theory of Computing
language:
Short-container-title:

Author:

Brakensiek Joshua¹,Gopi Sivakanth²,Makam Visu³

Affiliation:

1. Stanford University, USA

2. Microsoft Research, USA

3. Radix Trading Europe, Netherlands

Funder

National Science Foundation

Microsoft Research

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3564246.3585128

Reference53 articles.

1. Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes

2. Joshua Brakensiek , Sivakanth Gopi , and Visu Makam . 2022. Generic Reed-Solomon codes achieve list-decoding capacity. CoRR, abs/2206.05256 ( 2022 ), https://doi.org/10.48550/arXiv.2206.05256 arXiv:2206.05256. 10.48550/arXiv.2206.05256 Joshua Brakensiek, Sivakanth Gopi, and Visu Makam. 2022. Generic Reed-Solomon codes achieve list-decoding capacity. CoRR, abs/2206.05256 (2022), https://doi.org/10.48550/arXiv.2206.05256 arXiv:2206.05256.

3. Lower Bounds for Maximally Recoverable Tensor Codes and Higher Order MDS Codes

4. Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes

5. On the List and Bounded Distance Decodability of Reed–Solomon Codes

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Random Shortening of Linear Codes and Applications;Lecture Notes in Computer Science;2023-12-09

2. Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06