Skip to main content
placeholder image

Construction of deletion correting codes using generalized Reed-Solomon codes and their subcodes

Journal Article


Abstract


  • A code is n-deletion correcting if it is possible to correct any n deletion

    of symbols having occurred in transmission of codewords. In this paper, we present

    explicit constructions of n-deletion correcting codes for arbitrary values of n using

    generalized Reed–Solomon codes and their subcodes.

Publication Date


  • 2007

Citation


  • Tonien, D. & Safavi-Naini, R. (2007). Construction of deletion correting codes using generalized Reed-Solomon codes and their subcodes. Designs, Codes and Cryptography, 42 227-237.

Scopus Eid


  • 2-s2.0-33846209192

Number Of Pages


  • 10

Start Page


  • 227

End Page


  • 237

Volume


  • 42

Place Of Publication


  • United States

Abstract


  • A code is n-deletion correcting if it is possible to correct any n deletion

    of symbols having occurred in transmission of codewords. In this paper, we present

    explicit constructions of n-deletion correcting codes for arbitrary values of n using

    generalized Reed–Solomon codes and their subcodes.

Publication Date


  • 2007

Citation


  • Tonien, D. & Safavi-Naini, R. (2007). Construction of deletion correting codes using generalized Reed-Solomon codes and their subcodes. Designs, Codes and Cryptography, 42 227-237.

Scopus Eid


  • 2-s2.0-33846209192

Number Of Pages


  • 10

Start Page


  • 227

End Page


  • 237

Volume


  • 42

Place Of Publication


  • United States