time.
The recent interest in the OABST problem has been in
finding linear time solutions for the special types of
input sequences, see Section 1.2 for
references.
The subject of this study is to build implementation models for the Hu-Tucker algorithm, to evaluate the performance of the different implementations, and compare the compression ratios of the OABST vs. the OBT for large input sequences. Efficient model for building the the OABST was designed and implemented. The author didn't find, at the time of the writing of the paper, similar studies. Although publication of the implementation of the Hu-Tucker achieving O(n2) time complexity exist, see [Yoh72] for details, there is no data for experimental investigation of the experimental time complexity of the algorithm.
This study shows that the Hu-Tucker algorithm can be implemented efficiently and the implementation can build the OABST for extremely large data sets4.4, which makes the algorithm very practical for dictionaries and electronic texts encoding and decoding. The experiments also showed that the average difference of the length of the encoding using OABST and OBT, is close to 0.09 bits per word. The optimality that the OABST achieves, the performance of the implementation of the Hu-Tucker algorithm, and the embedded mechanism for fast encoding and decoding are very attractive for applications.
Acknowledgement
My sincere gratitute goes to Professor Stanislav P. Radsizsowski
for introducing me to this problem, for the
invaluable suggestions, and attention to my work.
I am very thankful to my family for their support.