Skip to Main Content
The bijective relationship between T-Code sets and finite strings discovered by Nicolescu and Titchener is of interest not only in coding, but also in information measurement and lately in content-based retrieval. Their T-decomposition algorithm that accomplishes the mapping from the string to the T-code set was implemented in 1996 by Wackrow and Titchener. This paper introduces a new algorithm that permits faster T-decomposition. Initial experimental results are also given.