Article ID Journal Published Year Pages File Type
9514448 Electronic Notes in Discrete Mathematics 2005 5 Pages PDF
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 to be asymptotically optimal.
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, , , , ,