Publisher
Springer Science and Business Media LLC
Reference8 articles.
1. Sudan M. Decoding of Reed-Solomon codes beyond the error-correction bound. J Complexity, 13: 180–193 (1997)
2. Guruswami V, Sudan M. Improved decoding of Reed-Solomon and algebraic-geometry codes. IEEE Trans Inform Theory, 45(6): 1757–1767 (1999)
3. Guruswami V, Vardy A. Maximum-likelihood decoding of Reed-Solomon codes is NP-hard. IEEE Trans Inform Theory, 51(7): 2249–2256 (2005)
4. Li J, Wan D. On the subset sum problem over finite fields. Finite Fields Appl, to appear
5. Cheng Q, Murray E. On deciding deep holes of Reed-Solomon codes. In: Proceedings of TAMC 2007, LNCS 4484. Berlin: Springer, 296–305
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献