| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 419878 | Discrete Applied Mathematics | 2008 | 8 Pages |
Abstract
In this paper we give a construction of T-shift synchronization codes, i.e. block codes capable of correcting synchronization shifts of length at most T in either direction (left or right). We prove lower and upper bounds on the maximal cardinality of such codes. An infinite number of the constructed codes turn out to be asymptotically optimal.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
R. Ahlswede, B. Balkenhol, C. Deppe, H. Mashurian, T. Partner,