A note on BSD codes constructed from T-codes
Ulrich Speidel · 2009
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.