Work

NP-Complete Problems for Lee Metric Codes

Year: 2020

Type: preprint

Abstract: We consider codes over finite rings endowed with the Lee metric and prove the NP-completeness of the associated syndrome decoding problem (SDP). Then, we study the best known algorithms for solving the SDP, which are information set decoding (ISD) algorithms, and generalize them to the Lee metric case. Finally we assess their complexity for a wide range of parameters.

Source: arXiv (Cornell University)

Authors: Violetta Weger, Paolo Santini, Massimo Battaglioni, Anna-Lena Trautmann

Language: English

Topic: Coding theory and cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W3007621739

Cites: 29

Cited by: 4

Related to: 20