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. The decoding radius exceeds the binary Johnson radius and the newly derived upper bound on the returned list size scales polynomially in the code parameters. Further, we provide simulation results on the probability of successful decoding by the proposed algorithm.

翻译：本文涉及$2美元间断二进制外差代码的解码列表。 提议的算法原则基于一个组合,即( 间断的) Reed- Solomon 代码的解码算法和( 非间断的) 外差代码的算法。 解码半径超过二进制约翰逊半径, 并在代码参数中, 返回的列表大小的多元尺度上层被新获得的。 此外, 我们提供模拟结果, 模拟拟议算法成功解码的可能性 。