T-shift synchronization codes

Authors:
R. Ahlswede;B. Balkenhol;C. Deppe;H. Mashurian;T. Partner
Affiliations:
Fakultät für Mathematik, Universität Bielefeld, Postfach 100131, 33501 Bielefeld, Germany;Fakultät für Mathematik, Universität Bielefeld, Postfach 100131, 33501 Bielefeld, Germany;Fakultät für Mathematik, Universität Bielefeld, Postfach 100131, 33501 Bielefeld, Germany;Fakultät für Mathematik, Universität Bielefeld, Postfach 100131, 33501 Bielefeld, Germany;Fakultät für Mathematik, Universität Bielefeld, Postfach 100131, 33501 Bielefeld, Germany
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 2
Cited 1

On the construction of maximal prefix-synchronized codes

IEEE Transactions on Information Theory - Part 2
On the construction of statistically synchronizable codes

IEEE Transactions on Information Theory - Part 2

Bibliography of publications by Rudolf Ahlswede

Information Theory, Combinatorics, and Search Theory

Quantified Score

Hi-index	0.05

Visualization

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.