Construction of deletion correting codes using generalized Reed-Solomon codes and their subcodes
RIS ID
101549
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 Details
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.