Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius-Reference-Cited by-同舟云学术

Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius

Published:2020-06-06 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Shangguan Chong¹,Tamo Itzhak¹

Affiliation:

1. Tel Aviv University, Israel

Funder

ISF grant

NSF-BSF grant

Publisher

ACM

Link

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

Reference33 articles.

1. Channel capacities for list codes

2. “Integer-making” theorems

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

4. Volodia M. Blinovski ˘ı. 1986. Bounds for codes in decoding by a list of finite length. Problemy Peredachi Informatsii 22 1 ( 1986 ) 11-25. Volodia M. Blinovski ˘ı. 1986. Bounds for codes in decoding by a list of finite length. Problemy Peredachi Informatsii 22 1 ( 1986 ) 11-25.

5. Asymptotic Combinatorial Coding Theory

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

1. Singleton-type bounds for list-decoding and list-recovery, and related results;Journal of Combinatorial Theory, Series A;2024-04

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

3. 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

4. Improved Field Size Bounds for Higher Order MDS Codes;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25

5. Improved Singleton-type bounds for list-decoding and average-radius list-decoding;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25