L. Rizzo, Effective erasure codes for reliable computer communication protocols, ACM SIGCOMM Computer Communication Review, vol.27, issue.2, pp.24-36, 1997.
DOI : 10.1145/263876.263881

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. Jiang and K. Narayanan, Iterative soft decision decoding of Reed Solomon codes based on adaptive parity check matrices, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004.
DOI : 10.1109/ISIT.2004.1365295

A. Ahmed, R. Koetter, and N. Shanbhag, Performance analysis of the adaptive parity check matrix based soft-decision decoding algorithm, Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004., 2004.
DOI : 10.1109/ACSSC.2004.1399514

M. El-khamy and R. J. Mceliece, Bounds on the average binary minimum distance and the maximum likelihood performance of Reed Solomon codes, 42nd Allerton Conf. on Communication, Control and Computing, 2004.

G. Wiechman and I. Sason, An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels, IEEE Transactions on Information Theory, vol.54, issue.5, pp.1962-1990, 2008.
DOI : 10.1109/TIT.2008.920216

S. Lin and D. J. Costello, Error control coding: fundamentals and applications, 1983.

F. R. Kschischang, B. J. Frey, and H. A. Loeliger, Factor graphs and the sum-product algorithm, IEEE Transactions on Information Theory, vol.47, issue.2, pp.498-519, 2001.
DOI : 10.1109/18.910572

C. Retter, The average binary weight-enumerator for a class of generalized Reed-Solomon codes, IEEE Transactions on Information Theory, vol.37, issue.2, pp.346-349, 1991.
DOI : 10.1109/18.75251