On the Error-Correcting Radius of Folded Reed???Solomon Code Designs, 4th Int. Castle Meeting on Coding Theory and Appl, pp.1-8, 2014. ,
DOI : 10.1007/978-3-319-17296-5_7
On multi-trial Forney?Kovalev decoding of concatenated codes, Adv. Math. Commun, vol.8, issue.1, pp.1-20, 2014. ,
Generalized minimum distance decoding, IEEE Transactions on Information Theory, vol.12, issue.2, pp.125-131, 1966. ,
DOI : 10.1109/TIT.1966.1053873
Improved decoding of Reed-Solomon and algebraic-geometry codes, IEEE Transactions on Information Theory, vol.45, issue.6, pp.1757-1767, 1999. ,
DOI : 10.1109/18.782097
Two classes of minimum generalized distance decoding algorithms, Probl. Inf. Transm, vol.22, pp.186-192, 1986. ,
Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs, IEEE Transactions on Information Theory, vol.55, issue.7, pp.2991-3012, 2009. ,
DOI : 10.1109/TIT.2009.2021308
Multitrial decoding of concatenated codes using fixed thresholds, Problems of Information Transmission, vol.46, issue.2, pp.127-141, 2010. ,
DOI : 10.1134/S0032946010020031
On Extended Forney-Kovalev GMD decoding, 2009 IEEE International Symposium on Information Theory, pp.1393-1397, 2009. ,
DOI : 10.1109/ISIT.2009.5205900
Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff, Problems of Information Transmission, vol.48, issue.4, pp.324-333, 2013. ,
DOI : 10.1134/S0032946012040023
Reduced GMD decoding, IEEE Transactions on Information Theory, vol.49, issue.4, pp.1013-1027, 2003. ,
DOI : 10.1109/TIT.2003.809504