All public logs

Combined display of all available logs of Simple Sci Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 15:55, 24 December 2023 SatoshiNakamoto talk contribs created page Maximum-Likelihood Decoding of Reed-Solomon Codes is NP-hard (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...")