List Decoding of 2-Interleaved Binary Alternant Codes

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

doi:10.1109/ISIT50566.2022.9834689

List Decoding of 2-Interleaved Binary Alternant Codes

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

Associate Professorship of Coding and Cryptography

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	2022 IEEE International Symposium on Information Theory, ISIT 2022
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	2338-2343
Number of pages	6
ISBN (Electronic)	9781665421591
DOIs	https://doi.org/10.1109/ISIT50566.2022.9834689
State	Published - 2022
Event	2022 IEEE International Symposium on Information Theory, ISIT 2022 - Espoo, Finland Duration: 26 Jun 2022 → 1 Jul 2022

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2022-June
ISSN (Print)	2157-8095

Conference

Conference	2022 IEEE International Symposium on Information Theory, ISIT 2022
Country/Territory	Finland
City	Espoo
Period	26/06/22 → 1/07/22

Access to Document

10.1109/ISIT50566.2022.9834689

Cite this

Huang, C. C., Liu, H., Holzbaur, L., Puchinger, S., & Wachter-Zeh, A. (2022). List Decoding of 2-Interleaved Binary Alternant Codes. In 2022 IEEE International Symposium on Information Theory, ISIT 2022 (pp. 2338-2343). (IEEE International Symposium on Information Theory - Proceedings; Vol. 2022-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT50566.2022.9834689

@inproceedings{e99786d67bb14e7594ec855efc65ac54,

title = "List Decoding of 2-Interleaved Binary Alternant Codes",

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.",

author = "Huang, {Chih Chiang} and Hedongliang Liu and Lukas Holzbaur and Sven Puchinger and Antonia Wachter-Zeh",

note = "Publisher Copyright: {\textcopyright} 2022 IEEE.; 2022 IEEE International Symposium on Information Theory, ISIT 2022 ; Conference date: 26-06-2022 Through 01-07-2022",

year = "2022",

doi = "10.1109/ISIT50566.2022.9834689",

language = "English",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "2338--2343",

booktitle = "2022 IEEE International Symposium on Information Theory, ISIT 2022",

}

Huang, CC, Liu, H, Holzbaur, L, Puchinger, S & Wachter-Zeh, A 2022, List Decoding of 2-Interleaved Binary Alternant Codes. in 2022 IEEE International Symposium on Information Theory, ISIT 2022. IEEE International Symposium on Information Theory - Proceedings, vol. 2022-June, Institute of Electrical and Electronics Engineers Inc., pp. 2338-2343, 2022 IEEE International Symposium on Information Theory, ISIT 2022, Espoo, Finland, 26/06/22. https://doi.org/10.1109/ISIT50566.2022.9834689

List Decoding of 2-Interleaved Binary Alternant Codes. / Huang, Chih Chiang; Liu, Hedongliang; Holzbaur, Lukas et al.
2022 IEEE International Symposium on Information Theory, ISIT 2022. Institute of Electrical and Electronics Engineers Inc., 2022. p. 2338-2343 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2022-June).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - List Decoding of 2-Interleaved Binary Alternant Codes

AU - Huang, Chih Chiang

AU - Liu, Hedongliang

AU - Holzbaur, Lukas

AU - Puchinger, Sven

AU - Wachter-Zeh, Antonia

PY - 2022

Y1 - 2022

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85136246607&partnerID=8YFLogxK

U2 - 10.1109/ISIT50566.2022.9834689

DO - 10.1109/ISIT50566.2022.9834689

M3 - Conference contribution

AN - SCOPUS:85136246607

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2338

EP - 2343

BT - 2022 IEEE International Symposium on Information Theory, ISIT 2022

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2022 IEEE International Symposium on Information Theory, ISIT 2022

Y2 - 26 June 2022 through 1 July 2022

ER -

List Decoding of 2-Interleaved Binary Alternant Codes

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this