Success probability of decoding interleaved alternant codes

Lukas Holzbaur, Hedongliang Liu, Alessandro Neri, Sven Puchinger, Johan Rosenkilde, Vladimir Sidorenko, Antonia Wachter-Zeh

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review


Interleaved Reed–Solomon codes admit efficient decoding algorithms which correct burst errors far beyond half the minimum distance in the random errors regime, e.g., by computing a common solution to the Key Equation for each Reed–Solomon code, as described by Schmidt et al. If this decoder does not succeed, it may either fail to return a codeword or miscorrect to an incorrect codeword, and good upper bounds on the fraction of error matrices for which these events occur are known. The decoding algorithm immediately applies to interleaved alternant codes as well, i.e., the subfield subcodes of interleaved Reed–Solomon codes, but the fraction of decodable error matrices differs, since the error is now restricted to a subfield. In this paper, we present new general lower and upper bounds on the fraction of decodable error matrices by Schmidt et al.’s decoding algorithm, thereby making it the only decoding algorithm for interleaved alternant codes for which such bounds are known.
Original languageEnglish
Title of host publicationProceedings of 2020 IEEE Information Theory Workshop
Number of pages5
Publication date2021
Article number9457607
ISBN (Print)978-1-7281-5963-8
Publication statusPublished - 2021
Event2020 IEEE Information Theory Workshop - Virtual Event, Riva del Garda, Italy
Duration: 11 Apr 202115 Apr 2021


Workshop2020 IEEE Information Theory Workshop
LocationVirtual Event
CityRiva del Garda
Internet address


Dive into the research topics of 'Success probability of decoding interleaved alternant codes'. Together they form a unique fingerprint.

Cite this