论文标题
列表解码2交替二进制代码
List Decoding of 2-Interleaved Binary Alternant Codes
论文作者
论文摘要
本文涉及列表$ 2 $ - 间接二进制备用代码的列表解码。所提出的算法的原理基于（交错）芦苇 - 溶剂代码的列表解码算法的组合和（非相互交替的）备用代码的算法。得出了解码半径上的新上限，并且列表大小显示在代码参数中缩放多个缩放。尽管该上限是可以实现的，但仍然是一个空旷的问题，但提供的仿真结果表明，通过提出的算法可以通过高概率来解码成功的二进制二进制半径的解码半径。
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.
