Author:
Berthomieu Jérémy,Lecerf Grégoire,Quintin Guillaume
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Algebra and Number Theory
Reference48 articles.
1. Alekhnovich, M.: Linear Diophantine equations over polynomials and soft decoding of Reed–Solomon codes. IEEE Trans. Inf. Theory 51(7), 2257–2265 (2005)
2. Armand, M.A.: Improved list decoding of generalized Reed–Solomon and alternant codes over rings. In: IEEE International Symposium on Information Theory 2004, (ISIT 2004), p. 384 (2004)
3. Armand, M.A.: List decoding of generalized Reed–Solomon codes over commutative rings. IEEE Trans. Inf. Theory 51(1), 411–419 (2005)
4. Augot, D., Barbier, M., Couvreur, A.: List-decoding of binary Goppa codes up to the binary Johnson bound. In: Information Theory Workshop (ITW), 2011 IEEE, pp. 229–233 (2011)
5. Augot, D., Zeh, A.: On the Roth and Ruckenstein equations for the Guruswami–Sudan algorithm. In: IEEE International Symposium on Information Theory-ISIT 2008, pp. 2620–2624. IEEE, Toronto, Canada (2008)
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献