Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings-Reference-Cited by-同舟云学术

Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings

Published:2024-03-19 Issue:2 Volume:53 Page:389-430
ISSN:0097-5397
Container-title:SIAM Journal on Computing
language:en
Short-container-title:SIAM J. Comput.

Author:

Guo Zeyu¹^ORCID,Li Ray²^ORCID,Shangguan Chong³^ORCID,Tamo Itzhak⁴,Wootters Mary⁵^ORCID

Affiliation:

1. Department of Computer Science, UT Austin, Austin, TX 78712 USA.

2. Department of Computer Science, Stanford University, Stanford, CA 94305 USA.

3. Research Center for Mathematics and Interdisciplinary Sciences, Shandong University, Qingdao 266237, China, and Frontiers Science Center for Nonlinear Expectations, Ministry of Education, Qingdao 266237, China.

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

5. Departments of Computer Science and Electrical Engineering, Stanford University, Stanford, CA 94305 USA.

Funder

National Key Research and Development Program of China

Milgrom Family Grant

Jacob Fox's Packard Fellowship

Sloan Research Fellowship

European Research Council

Israel Science Foundation

National Natural Science Foundation of China

Natural Science Foundation of Shandong Province

National Science Foundation

United States-Israel Binational Science Foundation

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Reference44 articles.

1. Balanced Families of Perfect Hash Functions and Their Applications

2. Balanced Hashing, Color Coding and Approximate Counting

3. Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions

4. Cambridge Math. Library 67;Biggs N.,1993

5. Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs