A note on BSD codes constructed from T-codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
A differential equation method to derive the formulas of the T-complexity and the LZ-complexity
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
| Hi-index | 0.00 |
In a recent report, Gulliver and Speidel showed that completesets of aperiodic and - in some cases periodic - necklaces can begenerated for arbitrary lengths as fixed-length subsets ofvariable-length T-codes. The T-codes to which they applied thisobservation were specifically T-codes constructed by systematicT-augmentation, that is by T-augmentation sequences in which eachT-expansion parameter is 1 (simple T-augmentation) and where theT-codes A_{(p1,p2,...,pi)} at each Taugmentation level i do notcontain any codewords shorter than pi (strictly minimalT-augmentation). This present paper generalizes their result toarbitrary T-codes and formalizes their earlier result as a specialcase of the general result.