L. Calabi/W. Hartnett: A family of codes for the correction of substition
and synchronization errors. IEEE Trans. Inf. Theory 15/1 (1969), 102-106.

L. Calabi/W. Hartnett: Some general results of coding theory with
applications to the study of codes for the correction of synchronization
errors. Inf. and Control 15 (1969), 235-249.

V. Levenshtein: Binary codes capable of correcting deletions, insertions,
and reversals. Dokl. AN 163/4 (1965), 845-848. (Russian)

V. Levenshtein: Binary codes capable of correcting spurious insertions and
deletions of ones. Problems Inf. Transmission 1/1 (1965), 8-17.

V. Levenshtein: A method of constructing quasilinear codes providing
synchronization in the presence of errors.
Problems Inf. Transmission 7/3 (1971), 215-222.

F. Sellers: Bit loss and gain correction code.
IRE Trans. Inf. Theory 8 (1962), 35-38.

E. Tanaka/T. Kasai: Synchronization and substitution error-correcting codes
for the Levenshtein metric. IEEE Trans. Inf. Theory IT-22 (1976), 156-162.

J. Ullman: Near-optimal, single-synchronization-error-correcting-code.
IEEE Trans. Inf. Theory 12 (1966), 418-424.

J. Ullman: On the capabilities of codes to correct synchronization errors.
IEEE Trans. Inf. Theory IT-13 (1967), 95-105.