Skip Navigation

The Computer Journal 2002 45(2):243-248; doi:10.1093/comjnl/45.2.243
© 2002 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Balakirsky, V. B.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Block Codes for Asynchronous Data Transmission Designed from Binary Trees

Vladimir B. Balakirsky1

1 Euler Institute for Discrete Mathematics and its Applications (EIDMA), Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands Email: v.b.balakirsky@tue.nl

We describe a class of codes that can be effectively used when one of $q^n$ vectors of length $n$ has to be delivered to the receiver over a noiseless $q$-ary channel in asynchronous mode assuming that the latter one receives the transmitted vector with the delay $\tau\in\{0,\dotsc,n-1\}$, unknown in advance, while all other received symbols are arbitrarily chosen. The codes are specified for any $n$ by a regular algorithm, which is based on properties of ordered, oriented, rooted, binary trees, and have length $N\approx n + 2$ log$_q n$. We show that these codes can be used in such a way that encoding and decoding complexities are measured by linear functions of $n$.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.