论文标题
在有限环上对Lee-Metric代码的信息集解码
Information set decoding of Lee-metric codes over finite rings
论文作者
论文摘要
信息集解码（ISD）算法是解决通用线性代码解码问题的最著名过程。因此，这些算法用于没有可见结构的代码，或者为此尚不清楚利用代码结构的有效解码器。从经典上讲，已经研究了ISD算法的锤量指标中的代码。在本文中，我们从锤式指标转换为Lee指标，并研究ISD算法及其对用Lee Metric在有限环上测量的代码的复杂性。
Information set decoding (ISD) algorithms are the best known procedures to solve the decoding problem for general linear codes. These algorithms are hence used for codes without a visible structure, or for which efficient decoders exploiting the code structure are not known. Classically, ISD algorithms have been studied for codes in the Hamming metric. In this paper we switch from the Hamming metric to the Lee metric, and study ISD algorithms and their complexity for codes measured with the Lee metric over finite rings.
