Decoding interleaved Reed–Solomon codes beyond their joint error-correcting capability

Author： Wachter-Zeh Antonia Zeh Alexander Bossert Martin

ISSN： 0925-1022

Source： Designs, Codes and Cryptography, Vol.71, Iss.2, 2014-05, pp. : 261-281

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Construction of deletion correcting codes using generalized Reed–Solomon codes and their subcodes

By Tonien Dongvu Safavi-Naini Reihaneh

Designs, Codes and Cryptography, Vol. 42, Iss. 2, 2007-02 ,pp. : 227-237

Springer Publishing Company

Access to resources Recommend Favorite

Artinian rings, finite principal ideal rings and algebraic error-correcting codes

Bulletin of the Australian Mathematical Society, Vol. 59, Iss. 3, 1999-06 ,pp. : 525-526

Cambridge University Press

Access to resources Recommend Favorite

Fast Decoding Algorithms for First Order Reed-Muller and Related Codes

By Ashikhmin Alexey E. Litsyn Simon N.

Designs, Codes and Cryptography, Vol. 7, Iss. 3, 1996-03 ,pp. : 187-214

Springer Publishing Company

Access to resources Recommend Favorite

Improved lower bounds on sizes of single-error correcting codes

By Litsyn Simon Mounits Beniamin

Designs, Codes and Cryptography, Vol. 42, Iss. 1, 2007-01 ,pp. : 67-72

Springer Publishing Company

Access to resources Recommend Favorite

Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes

By Östergård Patric

Designs, Codes and Cryptography, Vol. 59, Iss. 1-3, 2011-04 ,pp. : 281-285

Springer Publishing Company

Access to resources Recommend Favorite