2017/01/23 by Sven Puchinger, Puchinger, Sven, Nielsen, Johan Rosenkilde né
Computer Science · Engineering · #Cellular Automata and Applications #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1701.06555
openalex publication_date 2017/01/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We propose a new partial decoding algorithm for m-interleaved Reed--Solomon (IRS) codes that can decode, with high probability, a random error of relative weight 1-R(m)/(m+1) at all code rates R, in time polynomial in the code length n. For m>2, this is an asymptotic improvement over the previous state-of-the-art for all rates, and the first improvement for R>1/3 in the last 20 years. The method combines collaborative decoding of IRS codes with power decoding up to the Johnson radius.