On deep holes of standard Reed-Solomon codes
暂无分享,去创建一个
[1] Daqing Wan,et al. On the subset sum problem over finite fields , 2008, Finite Fields Their Appl..
[2] Robert J. McEliece,et al. The Theory of Information and Coding , 1979 .
[3] Madhu Sudan,et al. Maximum-likelihood decoding of Reed-Solomon codes is NP-hard , 1996, IEEE Transactions on Information Theory.
[4] Andrei V. Kelarev,et al. The Theory of Information and Coding , 2005 .
[5] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[7] Qi Cheng,et al. On Deciding Deep Holes of Reed-Solomon Codes , 2007, TAMC.
[8] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[9] Yuan Zhou. Introduction to Coding Theory , 2010 .