Maximum-Likelihood Decoding of Reed-Solomon Codes is NP-hard: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 15:5515:55, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,982 bytes +1,982‎ Created page with "Title: Maximum-Likelihood Decoding of Reed-Solomon Codes is NP-hard Research Question: Can maximum-likelihood decoding be made easier for any nontrivial family of codes with algebraic structure? Methodology: The researchers used the technique of reduction, which is a common method in complexity theory to prove that a problem is NP-hard. They reduced the maximum-likelihood decoding problem of general linear codes to a problem known as Three-Dimensional Matching, which i..."
Retrieved from "https://simplesci.org/wiki/Maximum-Likelihood_Decoding_of_Reed-Solomon_Codes_is_NP-hard"