ADJACENT-ERROR CORRECTING BINARY PERFECT CODES
Bhu Dev Sharma, Bal Kishan Dass · Journal of Cybernetics · 1977
A new type of codes that correct only a given number of adjacent errors in the binary case have been introduced in this paper. These codes are adjacent-error correcting perfect and form a doubly infinite class, i.e., for a given number of adjacent errors these exist for different lengths as also for different number of adjacent errors these can be developed for specific lengths.