Singleton-type bounds for list-decoding and list-recovery, and related results-Reference-Cited by-同舟云学术

Singleton-type bounds for list-decoding and list-recovery, and related results

Published:2022-06-26 Issue: Volume: Page:
ISSN:
Container-title:2022 IEEE International Symposium on Information Theory (ISIT)
language:
Short-container-title:

Author:

Goldberg Eitan¹,Shangguan Chong¹,Tamo Itzhak¹

Affiliation:

1. Tel-Aviv University,Department of Electrical Engineering–Systems,Tel-Aviv,Israel

Funder

European Research Council

Israel Science Foundation

National Key Research and Development Program of China

National Natural Science Foundation of China

Natural Science Foundation of Shandong Province

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/9834325/9834269/09834849.pdf?arnumber=9834849

Reference26 articles.

1. Asymptotic Combinatorial Coding Theory

2. Error-correcting codes for list decoding

3. On the Hardness of Permanent

4. Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes

5. On the list recoverability of randomly punctured codes;lund;Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques,2020

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

1. Randomly Punctured Reed–Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. AG Codes Achieve List Decoding Capacity over Constant-Sized Fields;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. Generalized GM-MDS: Polynomial Codes Are Higher Order MDS;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

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

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