Abstract:
In 1995, Nicolescu and Titchener showed that every finite string could be used to generate a unique recursively constructed variable-length code set belonging to the family of the T-codes. The present paper shows how this duality may be exploited to assess the randomness of strings and provide guidance in the construction of pseudo-random strings.