List Decoding of 2-Interleaved Binary Alternant Codes

Chih Chiang Huang, Hedongliang Liu, Lukas Holzbaur, Sven Puchinger, Antonia Wachter-Zeh

Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

Abstract

This paper is concerned with list decoding of 2-interleaved binary alternant codes. The principle of the proposed algorithm is based on a combination of a list decoding algorithm for (interleaved) Reed-Solomon codes and an algorithm for (non-interleaved) alternant codes. A new upper bound on the decoding radius is derived and the list size is shown to scale polynomially in the code parameters. While it remains an open problem whether this upper bound is achievable, the provided simulation results show that a decoding radius exceeding the binary Johnson radius can be achieved with a high probability of decoding success by the proposed algorithm.

OriginalspracheEnglisch
Titel2022 IEEE International Symposium on Information Theory, ISIT 2022
Herausgeber (Verlag)Institute of Electrical and Electronics Engineers Inc.
Seiten2338-2343
Seitenumfang6
ISBN (elektronisch)9781665421591
DOIs
PublikationsstatusVeröffentlicht - 2022
Veranstaltung2022 IEEE International Symposium on Information Theory, ISIT 2022 - Espoo, Finnland
Dauer: 26 Juni 20221 Juli 2022

Publikationsreihe

NameIEEE International Symposium on Information Theory - Proceedings
Band2022-June
ISSN (Print)2157-8095

Konferenz

Konferenz2022 IEEE International Symposium on Information Theory, ISIT 2022
Land/GebietFinnland
OrtEspoo
Zeitraum26/06/221/07/22

Fingerprint

Untersuchen Sie die Forschungsthemen von „List Decoding of 2-Interleaved Binary Alternant Codes“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren