FR4.R3.2

Explicit Subcodes of Reed–Solomon Codes that Efficiently Achieve List Decoding Capacity

Amit Berman, Yaron Shany, Samsung Semiconductor, Israel; Itzhak Tamo, Tel-Aviv University, Israel
Session:
List Decoding
Track:
1: Algebraic Aspects of Coding Theory
Location:
Ypsilon IV-V-VI
Presentation Time:
Fri, 12 Jul, 16:45 - 17:05
Session Chair:
Vinayak Ramkumar, Tel Aviv University
Presentation
Not logged in.
Discussion
Not logged in.
Session FR4.R3
FR4.R3.1: Points-Polynomials Incidence Theorem with an Application to Reed-Solomon Codes
Itzhak Tamo, Tel-Aviv University, Israel
FR4.R3.2: Explicit Subcodes of Reed–Solomon Codes that Efficiently Achieve List Decoding Capacity
Amit Berman, Yaron Shany, Samsung Semiconductor, Israel; Itzhak Tamo, Tel-Aviv University, Israel
FR4.R3.3: Multiplicity assignments for Koetter-Vardy decoding. The case of traceability codes.
Marcel Fernandez, Josep Cotrina Navau, Universitat Politecnica de Catalunya, Spain
FR4.R3.4: Quasi-OSD of Binary Image of RS Codes with Applications to JSCC
Xiangping Zheng, Qianfan Wang, Baodian Wei, Xiao Ma, Sun Yat-sen University, China
Resources
No resources available.