Papers
Topics
Authors
Recent
Search
2000 character limit reached

Bounds and Algorithms for Alphabetic Codes and Binary Search Trees

Published 23 Jul 2024 in cs.IT, cs.DS, and math.IT | (2407.16443v1)

Abstract: Alphabetic codes and binary search trees are combinatorial structures that abstract search procedures in ordered sets endowed with probability distributions. In this paper, we design new linear-time algorithms to construct alphabetic codes, and we show that the obtained codes are not too far from being optimal. Moreover, we exploit our results on alphabetic codes to provide new bounds on the average cost of optimal binary search trees. Our results improve on the best-known bounds on the average cost of optimal binary search trees present in the literature.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (25)
  1. J. Abrahams, “Code and parse trees for lossless source encoding”, Commun. Inf. Syst., vol. 1, pp. 113–146, 2001.
  2. Y. Dagan, Y. Filmus, A. Gabizon and S. Moran, “Twenty (simple) questions”, Proceedings of The 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC2017, pp. 9–21, 2017.
  3. R. De Prisco and A. De Santis, “On binary search trees”, Information Processing Letters, vol. 45, pp. 249–253, 1993.
  4. R. De Prisco and A. De Santis, “New lower bounds on the cost of binary search trees”, Theoretical Computer Science, vol. 156, pp. 315–325, 1996.
  5. M. Fredman, “Two applications of a probabilistic search technique: Sorting X + Y and building balanced search trees”, Proceedings of the Seventh Annual ACM Symposium on Theory of Computing, STOC ’75, pp. 240–244, 1975.
  6. M. Garey, “Optimal binary identification procedures”, SIAM Journal on Applied Mathematics, vol. 23, pp. 173–186, 1972.
  7. E. Gilbert and E. Moore, “Variable-length binary encodings”, Bell System Technical Journal, vol. 38, pp. 933–967, 1959.
  8. R. Hassin and A. Sarid, “Operations research applications of dichotomous search”, European Journal of Operational Research, vol. 265, Issue 3, pp. 795–812, 2018.
  9. T. Hiraoka and H. Yamamoto, “Alphabetic AIFV codes constructed from Hu-Tucker codes”. In: Proceedings of the 2018 IEEE International Symposium on Information Theory (ISIT 2018), pp. 2182–2186, 2018.
  10. Y. Horibe, “An improved bound for weight-balanced tree”, Information and Control, vol. 34, 148–151, 1977.
  11. T. Hu and A. Tucker, “Optimal computer search trees and variable-length alphabetical codes”, SIAM Journal on Applied Mathematics, vol. 21, pp. 514–532, 1971.
  12. K.-i. Iwata and H. Yamamoto, “An algorithm for constructing the optimal code trees for binary alphabetic AIFV-m codes”. In: Proceedings of the 2020 IEEE Information Theory Workshop (ITW 2020), pp. 1–5, 2021.
  13. G.O.H. Katona, “Combinatorial Search Problems”, in: Survey of Combinatorial Theory, J.N. Srivastava (Ed.), North Holland/American Elsevier, Amsterdam/New York), pp. 285–308, 1973.
  14. D.J. Kleitman and M.E. Saks, “Set orderings requiring costliest alphabetic binary trees”, SIAM Journal on Algebraic Discrete Methods, vol. 2, No. 2, pp. 142–146, 1981.
  15. D.E. Knuth, “Optimum binary search trees”, Acta Informatica, vol. 1, pp. 14–-25, (1971).
  16. J. Kujala, personal communication.
  17. E.S. Laber, R.L. Milidiu, and A.A. Pessoa, “Practical constructions of L-restricted alphabetic prefix codes”. In: Proceedings of the 6th International Symposium on String Processing and Information Retrieval, pp. 115–119, 1999.
  18. K. Mehlhorn, “Nearly optimal binary search trees”, Acta Informatica, vol. 5, pp. 287–295, 1975.
  19. K. Mehlhorn, “Searching, sorting, and information theory”. In: J. Becvar (eds) Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol 74, pp. 131–145, Springer, Berlin, Heidelberg, 1979.
  20. S.V. Nagaraj, “Optimal binary search trees”, Theoretical Computer Science vol. 188, pp. 1–44, 1997.
  21. N. Nakatsu, “Bounds on the redundancy of binary alphabetical codes”, IEEE Transactions on Information Theory, vol. 37, pp. 1225–1229, 1991.
  22. J. Nievergelt, “Binary search trees and file organization”, ACM Computing Surveys, Vol. 6, No. 3, pp. 195–207, 1974.
  23. K. Pattipati and M. Alexandridis, “Application of heuristic search and information theory to sequential fault diagnosis”, IEEE Transactions on Systems, Man, and Cybernetics, vol. 20, pp. 872–887, 1990.
  24. D. Sheinwald, “On binary alphabetical codes”, Data Compression Conference, IEEE Press, pp. 112–113, 1992.
  25. R. Yeung, “Alphabetic codes revisited”, IEEE Transactions on Information Theory, vol. 37, pp. 564–572, 1991.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up