Mathematical optimization and the synchronizing properties of encodings

https://doi.org/10.1016/0890-5401(88)90045-4Get rights and content
Under an Elsevier user license
open archive

Abstract

Methods for constructing binary exhaustive prefix codes with certain synchronizing properties are given. In particular it is shown how to formulate the requirement that a code be anagrammatic and the requirement for minimal synchronizing delay as linear integer programming problems. The tree structure of the code is given and the program optimizes over all possible labelings of the tree. Several examples, solved by a commercially available linear/integer programming package, are included.

Cited by (0)