{"title":" RS\u7b26\u53f7\u306eMLD\u306fNP\u56f0\u96e3","blog_title":"186 @ hatenablog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2F186.hatenablog.com%2Fentry%2F20080224%2F1203856602\" title=\" RS\u7b26\u53f7\u306eMLD\u306fNP\u56f0\u96e3 - 186 @ hatenablog\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","image_url":null,"author_name":"smoking186","url":"https://186.hatenablog.com/entry/20080224/1203856602","version":"1.0","type":"rich","blog_url":"https://186.hatenablog.com/","description":"Guruswami and Vardy \u201cMaximum-Likelihood Decoding of Reed-Solomon Codes is NP-hard\u201d (SODA 2005). MLD\u306f\u6700\u5c24\u5fa9\u53f7\u3067\u3044\u3044\u3093\u3060\u3063\u305f\u304b\u306a. MLD-Linear\u3068\u306fF_q\u8981\u7d20\u306em\u00d7n\u884c\u5217\u3068\u30b7\u30f3\u30c9\u30ed\u30fc\u30e0s\u3068\u6b63\u6574\u6570w\u3092\u5165\u529b\u3068\u3057\u3066, Hv^t=s^t\u304b\u3064\u30cf\u30df\u30f3\u30b0\u91cd\u307f\u304cw\u4ee5\u4e0b\u3068\u306a\u308bn\u6b21\u306eF_q\u8981\u7d20\u306e\u30a8\u30e9\u30fc\u30d9\u30af\u30c8\u30ebv\u304c\u5b58\u5728\u3059\u308b\u304b\u3069\u3046\u304b\u3092\u7b54\u3048\u308b\u554f\u984c. \u307e\u305f\u306e\u540d\u3092Syndrome Decoding Problem\u3068\u8a00\u3046. (Stern93\u3084Stern96\u3067\u306f, \u3053\u306e\u540d\u524d\u3060\u3063\u305f.) Berlekamp, McEliece\u2026","height":"190","provider_name":"Hatena Blog","published":"2008-02-24 21:36:42","width":"100%","categories":["CS","\u7b26\u53f7"],"author_url":"https://blog.hatena.ne.jp/smoking186/","provider_url":"https://hatena.blog"}