Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed???Solomon Codes, IEEE Transactions on Information Theory, vol.51, issue.7, pp.2257-2265, 2005. ,
DOI : 10.1109/TIT.2005.850097
Improved list decoding of generalized reed-solomon and alternant codes over rings, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., p.384, 2004. ,
DOI : 10.1109/ISIT.2004.1365421
Improved List Decoding of Generalized Reed???Solomon and Alternant Codes Over Galois Rings, IEEE Transactions on Information Theory, vol.51, issue.2, pp.728-733, 2005. ,
DOI : 10.1109/TIT.2004.840901
Multistage list decoding of generalized reed-solomon codes over galois rings, IEEE Communications Letters, vol.9, issue.7, pp.625-627, 2005. ,
DOI : 10.1109/LCOMM.2005.1461685
Introduction to commutative algebra, ser. Addison-Wesley series in mathematics, 1994. ,
On the Roth and Ruckenstein equations for the Guruswami-Sudan algorithm, 2008 IEEE International Symposium on Information Theory, pp.2620-2624, 2008. ,
DOI : 10.1109/ISIT.2008.4595466
URL : https://hal.archives-ouvertes.fr/inria-00509209
Decoding of linear codes over galois rings Information Theory, IEEE Transactions on, vol.47, issue.4, pp.1599-1603, 2001. ,
On quasi-cyclic codes as a generalization of cyclic codes, Finite Fields and Their Applications, vol.18, issue.5, 2011. ,
DOI : 10.1016/j.ffa.2012.06.003
URL : https://hal.archives-ouvertes.fr/inria-00615276
Algebraic coding theory, ser. M-6, 1984. ,
Error correction for algebraic block codes, 1986. ,
Skew-cyclic codes Applicable Algebra in Engineering, Communication and Computing, vol.18, pp.379-389, 2007. ,
Skew constacyclic codes over Galois rings Advances in mathematics of communications, pp.273-292, 2008. ,
Codes as Modules over Skew Polynomial Rings, Lecture Notes in Computer Science, vol.5921, pp.38-55, 2009. ,
DOI : 10.1007/978-3-642-10868-6_3
URL : https://hal.archives-ouvertes.fr/hal-00398355
Lifting Decoding Schemes over a Galois Ring, Applied Algebra, pp.323-332, 2001. ,
DOI : 10.1007/3-540-45624-4_34
On fast multiplication of polynomials over arbitrary algebras, Acta Informatica, vol.7, issue.7, pp.693-701, 1991. ,
DOI : 10.1007/BF01178683
Skew codes of prescribed distance or rank, Designs, Codes and Cryptography, vol.35, issue.3, pp.267-284, 2009. ,
DOI : 10.1007/s10623-008-9230-6
URL : https://hal.archives-ouvertes.fr/hal-00267034
Complexity Analysis of Reed-Solomon Decoding over GF without Using Syndromes, EURASIP Journal on Wireless Communications and Networking, vol.137, issue.2, 2008. ,
DOI : 10.1049/ip-com:20050022
Faster Integer Multiplication, Proceedings of the Thirty- Ninth ACM Symposium on Theory of Computing, pp.57-66, 2007. ,
A New Algorithm for Decoding Reed-Solomon Codes, pp.55-68, 2002. ,
DOI : 10.1007/978-1-4757-3789-9_5
Modern computer algebra, 2003. ,
DOI : 10.1017/CBO9781139856065
Efficient decoding of Z/sub p/k-linear codes, IEEE Transactions on Information Theory, vol.44, issue.3, pp.1288-1291, 1998. ,
DOI : 10.1109/18.669412
List decoding of error-correcting codes: winning thesis of the 2002 ACM doctoral dissertation competition, ser. Lecture Notes in Computer Science, 2004. ,
DOI : 10.1007/b104335
Improved decoding of Reed-Solomon and algebraic-geometric codes, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp.1757-1767, 1998. ,
DOI : 10.1109/SFCS.1998.743426
On the complexity of decoding Reed-Solomon codes (Corresp.), IEEE Transactions on Information Theory, vol.22, issue.2, pp.237-238, 1976. ,
DOI : 10.1109/TIT.1976.1055516
On Algebraic Decoding of Algebraic-Geometric and Cycling Codes, 1996. ,
Algebraic soft-decision decoding of reed-solomon codes, IEEE Transactions on Information Theory, vol.49, issue.11, pp.2809-2825, 2003. ,
DOI : 10.1109/TIT.2003.819332
Noncommutative Noetherian rings, ser. Graduate studies in mathematics, 2001. ,
Decoding Reed-Solomon codes beyond half the minimum distance, " in Coding Theory, Cryptography and Related Areas, 2000. ,
On the key equation over a commutative ring, Designs, Codes and Cryptography, vol.20, issue.2, pp.125-141, 2000. ,
DOI : 10.1023/A:1008385407717
Error-correcting codes, 1972. ,
Finite associative rings, Compositio Math, vol.21, pp.195-229, 1969. ,
Polynomial Codes Over Certain Finite Fields, Journal of the Society for Industrial and Applied Mathematics, vol.8, issue.2, pp.300-304, 1960. ,
DOI : 10.1137/0108018
Efficient decoding of Reed-Solomon codes beyond half the minimum distance, IEEE Transactions on Information Theory, vol.46, issue.1, p.56, 1998. ,
DOI : 10.1109/18.817522
Fast multiplication of large numbers, Computing, vol.150, issue.3-4, pp.281-292, 1971. ,
DOI : 10.1007/BF02242355
Corps locaux, ser. Actualités scientifiques et industrielles, pp.1296-1296, 1962. ,
Injective modules and prime ideals, Communications in Algebra, vol.133, issue.9, pp.989-999, 1981. ,
DOI : 10.1007/978-3-642-66066-5
Decoding Reed-Solomon codes beyond the error-correction diameter, the 35th Annual Allerton Conference on Communication, Control and Computing, pp.215-224, 1997. ,
Simplified procedure for correcting both errors and erasures of Reed-Solomon code using Euclidean algorithm, IEE Proceedings E Computers and Digital Techniques, vol.135, issue.6, pp.318-324, 1988. ,
DOI : 10.1049/ip-e.1988.0043
Reed-Solomon Codes and Their Applications, 1999. ,
DOI : 10.1109/9780470546345
Duality for modules over finite rings and applications to coding theory, American Journal of Mathematics, vol.121, issue.3, pp.555-575, 1999. ,
DOI : 10.1353/ajm.1999.0024