T-shift synchronization codes

13 years 11 months ago

Download www.math.uni-bielefeld.de

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.

Rudolf Ahlswede, Bernhard Balkenhol, Christian Dep

Real-time Traffic

DAM 2008 | Maximal Cardinality | Synchronization Shifts | T-shift Synchronization Codes |

claim paper

» Multithreaded code from synchronous programs Extracting independent threads for OpenMP

» Reconfigurable SoC design with hierarchical FSM and synchronous dataflow model

» LowComplexity ListBased Frame Synchronization for LDPC Coded Transmission

» Modular code generation from synchronous block diagrams modularity vs code size

» Software Implementation of Synchronous Programs

» CodeAssisted Synchronization for UWBIR Systems Algorithms and Analysis

» Concurrency Combinators for Declarative Synchronization

» Analysis of CodeAssisted Blind Synchronization for UWB Systems

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DAM
Authors	Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Haik Mashurian, T. Partner

Comments (0)

Sciweavers

T-shift synchronization codes

DAM 2008 | Maximal Cardinality | Synchronization Shifts | T-shift Synchronization Codes |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers