Codes correcting a single insertion/deletion of a zero or a single peak-shift

Authors:
T. Klove
Affiliations:
Dept. of Inf., Bergen Univ.
Venue:
IEEE Transactions on Information Theory
Year:
1995

Citing 0
Cited 3

Asymptotically good codes correcting insertions, deletions, and transpositions

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Construction of deletion correcting codes using generalized Reed---Solomon codes and their subcodes

Designs, Codes and Cryptography
Coding for a bit-shift channel with applications to inductively coupled channels

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications

Quantified Score

Hi-index	754.84

Visualization

Abstract

Codes of (d,k) sequences of constant Hamming weight are considered. Perfect codes correcting a single insertion, deletion, or peak-shift are defined and shown to exist. A systematic method to construct large classes of perfect codes is given. A number of related problems are considered