Abstract:
It is well known that any two non-identical codewords from a fixed-length code must belong to different non- periodic equivalence classes under cyclic shift for the code ...Show MoreMetadata
Abstract:
It is well known that any two non-identical codewords from a fixed-length code must belong to different non- periodic equivalence classes under cyclic shift for the code to have a bounded synchronization delay (BSD). Subsets of fixed- length codewords from T-codes, a family of variable-length codes (VLCs) known for strong statistical self-synchronization and a well-explained synchronization model, also follow this rule, albeit with some periodic exceptions. This paper shows how the T-code construction algorithm may be used for the simple construction of maximal block codes with bounded synchronization delay. These self-synchronizing codes are subsets of T-codes and thus resynchronization under decoding with a T-code decoder is both automatic and detectable.
Published in: 2007 IEEE International Symposium on Information Theory
Date of Conference: 24-29 June 2007
Date Added to IEEE Xplore: 09 July 2008
ISBN Information: