Maximum-likelihood decoding of Reed-Solomon codes is NP-hard

被引：41

作者：

Guruswami, V ^{[1
]}

Vardy, A

机构：

[1] Univ Washington, Dept Comp Sci & Engn, Seattle, WA 98195 USA

[2] Univ Calif San Diego, Dept Elect & Comp Engn, La Jolla, CA 92093 USA

[3] Univ Calif San Diego, Dept Comp Sci, La Jolla, CA 92093 USA

[4] Univ Calif San Diego, Dept Math, La Jolla, CA 92093 USA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2005年 / 51卷 / 07期

基金：

美国国家科学基金会;

关键词：

linear codes; maximum-likelihood decoding; NP-hard problems; Reed-Solomon codes;

D O I：

10.1109/TIT.2005.850102

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：2249 / 2256

页数：8

共 50 条

[41] An on-the-fly decoding technique for Reed-Solomon codes
Lee, YX
Deng, RH
Koh, EH
IEEE TRANSACTIONS ON MAGNETICS, 1996, 32 (05) : 3962 - 3964
[42] A Processor Accelerator for Software Decoding of Reed-Solomon Codes
Ito, Kazuhito
Nasu, Keisuke
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2012, E95A (05) : 884 - 893
[43] Burst List Decoding of Interleaved Reed-Solomon Codes
Kolan, Tom
Roth, Ron M.
IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (01) : 182 - 190
[44] CONTRACTED REED-SOLOMON CODES WITH COMBINATIONAL DECODING.
Carter, W.C.
Wadia, A.B.
IBM Technical Disclosure Bulletin, 1974, 17 (05): : 1505 - 1507
[45] Subcodes of Reed-Solomon codes suitable for soft decoding
Raj, Safitha J.
Thangaraj, Andrew
APPLIED ALGEBRA, ALGEBRAIC ALGORITHMS AND ERROR-CORRECTING CODES, PROCEEDINGS, 2007, 4851 : 217 - +
[46] Simple algorithms for decoding systematic Reed-Solomon codes
Mateer, Todd D.
DESIGNS CODES AND CRYPTOGRAPHY, 2013, 69 (01) : 107 - 121
[47] Decoding of Reed-Solomon codes for additive cost functions
Koetter, R
Vardy, A
ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 313 - 313
[48] Subspace polynomials and list decoding of Reed-Solomon codes
Ben-Sasson, Eli
Kopparty, Swastik
Radhakrishnan, Jaikumar
47TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2006, : 207 - +
[49] On Cauchy Matrices for Remainder Decoding of Reed-Solomon Codes
Ma, Chingwo
IEEE COMMUNICATIONS LETTERS, 2009, 13 (09) : 688 - 690
[50] On-the-fly decoding technique for Reed-Solomon codes
Lee, Yuan Xing
Deng, Robert H.
Koh, Eng Hean
IEEE Transactions on Magnetics, 1996, 32 (5 pt 1) : 3962 - 3964

← 1 2 3 4 5 →