Generalization of Tests for Certain Properties of Variable-Length Codes

Abstract

In a 1964 report, Riley had already indicated how to generalize the Sardinas/Patterson and Levenshtein theorems for per word errorless models to special per word substitution error models and it seemed obvious to Calabi that the same kind of theorems should hold for general per word substitution error models. This paper established such theorems; as usual, more ideas were introduced and more technical tools were created. The paper relies very heavily on the fact that our models insure the expandability of our code properties. Such expandability is essential for the tests.