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

Details Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard

2004-05-04

arxiv.org/abs/cs/0405005v1

Computer Science

Computational Complexity

16 pages, no figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-346114