Information set decoding of Lee-metric codes over finite rings
Cryptography and Security
2021-02-19 v2 Information Theory
math.IT
Abstract
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.
Keywords
Cite
@article{arxiv.2001.08425,
title = {Information set decoding of Lee-metric codes over finite rings},
author = {Violetta Weger and Massimo Battaglioni and Paolo Santini and Franco Chiaraluce and Marco Baldi and Edoardo Persichetti},
journal= {arXiv preprint arXiv:2001.08425},
year = {2021}
}
Comments
This is a preliminary result, which we have included in a new paper with new authors and thus not considered it as a replacement