Title :
A note on BSD codes constructed from T-codes
Author_Institution :
Dept. of Comput. Sci., Univ. of Auckland, Auckland, New Zealand
fDate :
June 28 2009-July 3 2009
Abstract :
The T-augmentation process is used to construct variable-length T-codes. In a previous paper, the author and T.A. Gulliver showed that it may also be used to construct block codes with bounded synchronization delay (BSD codes) as subsets of T-code codewords of a fixed length. However, only the existence of a bound on the synchronization delay was shown, and an actual bound was left as an open problem. The present paper formulates such an upper bound. The paper also discusses whether some of these subsets may represent maximal comma-free codes.
Keywords :
block codes; synchronisation; variable length codes; T-augmentation process; T-code codewords; block codes; maximal comma-free codes; synchronization delay; variable-length T-codes; Block codes; Computer science; Decoding; Delay; Dictionaries; Equations; Probability; Upper bound;
Conference_Titel :
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location :
Seoul
Print_ISBN :
978-1-4244-4312-3
Electronic_ISBN :
978-1-4244-4313-0
DOI :
10.1109/ISIT.2009.5206026
