On a class of efficient error-limiting variable-length codes
Peter G. Neumann · IEEE Transactions on Information Theory · 1962
Variable-length codes are considered whose code-word ends are defined by the occurrences in code text of particular sequences, called partition sequences (Section 2.1). Sets of partition sequences are used in this fashion to define exhaustive codes (Section 2.2). A procedure is developed (Section 2.3) for obtaining all such codes. Because of the partition sequences, these codes are quickly self-resynchronizing following errors. In addition, some are extremely efficient when used to encode natural languages (Section 3).