NP-Complete Problems for Lee Metric Codes

02/27/2020
by   Violetta Weger, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset