scientific article; zbMATH DE number 503206

zbMath0801.68085MaRDI QIDQ4279529

Jacques Stern

Publication date: 17 February 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Hamming distanceinteger latticesdecoding algorithms\({\mathcal N}{\mathcal P}\)-completeness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear codes (general theory) (94B05)

Related Items

Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius, The hardness of approximate optima in lattices, codes, and systems of linear equations, Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH