Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard
Venkatesan Guruswami, Alexander Vardy
Abstract
Maximum-likelihood decoding is one of the central algorithmic problems in coding theory. It has been known for over 25 years that maximum-likelihood decoding of general linear codes is NP-hard. Nevertheless, it was so far unknown whether maximum- likelihood decoding remains hard for any specific family of codes with nontrivial algebraic structure. In this paper, we prove that maximum-likelihood decoding is NP-hard for the family of Reed-Solomon codes. We moreover show that maximum-likelihood decoding of Reed-Solomon codes remains hard even with unlimited preprocessing, thereby strengthening a result of Bruck and Naor.
Create a lesson
Related papers
The determinantal complexity of the 4*4 permanent is 15
Karthik Sheshadri
A Width Hierarchy of Monotone Algebraic Branching Programs
Julian Dörfler, Alexander Rogovskyy
Mortality Is Undecidable for 2 × 2 Integer Matrices
Thanin Quartz, Ivan O. Shevchenko, Hans De Sterck et al.
Fourier Entropy Bounds via Approximations
Manaswi Paraashar, Nitin Saurabh
An Engineering Reading of the Bounded Halting Problem and Observable Properties of a Universal Machine
Sergey Salishev
Exhaustive Search Is Hard to Beat in Constant Depth for Hyperclique and Orthogonal Vectors
Nikolai Chukhin