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

Authors:
Dongvu Tonien;Reihaneh Safavi-Naini
Affiliations:
School of IT and CS, University of Wollongong, Wollongong, Australia 2522;School of IT and CS, University of Wollongong, Wollongong, Australia 2522
Venue:
Designs, Codes and Cryptography
Year:
2007

Citing 7
Cited 1

On the construction of perfect deletion-correcting codes using design theory

Designs, Codes and Cryptography
Existence of Perfect 3-Deletion-CorrectingCodes

Designs, Codes and Cryptography
A Combinatorial Construction for PerfectDeletion-Correcting Codes

Designs, Codes and Cryptography
Existence of Perfect 4-Deletion-Correcting Codes with Length Six

Designs, Codes and Cryptography
Improved decoding of Reed-Solomon and algebraic-geometry codes

IEEE Transactions on Information Theory
Reliable communication over channels with insertions, deletions, and substitutions

IEEE Transactions on Information Theory
Codes correcting a single insertion/deletion of a zero or a single peak-shift

IEEE Transactions on Information Theory

Spectrum of Sizes for Perfect Deletion-Correcting Codes

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.