Information set decoding of Lee-metric codes over finite rings
This work addresses decoding challenges for codes without visible structure in the Lee metric, but it is incremental as it adapts known methods to a different metric.
The paper tackled the decoding problem for linear codes in the Lee metric over finite rings by studying information set decoding algorithms, resulting in an analysis of their computational complexity.
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.