Abstract
The problem of representing in mathematical optimization terms the task of finding a best synchronizing code corresponding to a given unlabeled binary tree structure is addressed. An improved formulation, significantly more compact than any previously given, is derived. Next, the more general problem of finding such a synchronizing code corresponding to a set of integer word lengths alone is also shown to be solveable as an integer programming problem. Finally, the most general problem is formulated in similar optimization format: it treats the word lengths also as variables, and thus in a linear, integer program allows the deduction of that minimum redundancy code which has the best (relative to a heuristic measure of the complex phenomenon of synchronization) synchronizing properties.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call