Advertisement

Lopsided trees: Analyses, algorithms, and applications

Extended abstract
  • Vicky Siu-Ngan Choi
  • Mordecai Golin
Session 13: Data Structures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1099)

Abstract

A lopsided tree is a rooted, ordered, tree in which the length ci of an edge from a node to its ith child depends upon the value of i. In this paper we examine three problems on such trees and show how to apply the results to the analysis of problems in data compression (Varncodes) and distributed computing (broadcasting in the Postal model of communication).

Keywords

Varn Codes Fibonacci Recurrences Mellin Transforms Postal Model 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Doris Altenkamp and Kurt Mehlhorn, “Codes: Unequal Probabilities, Unequal Letter Costs,” Journal of the Association for Computing Machinery, 27(3) (July 1980) 412–427.Google Scholar
  2. 2.
    Amotz Bar-Noy and Shlomo Kipnis, “Designing Broadcasting Algorithms in the Postal Model for Message Passing Systems,” SPAA 1992 (to appear in Mathematical Systems Theory, 1994).Google Scholar
  3. 3.
    V. S.-N. Choi, Lopsided Trees: Analyses and Algorithms. M.Phil. Thesis, Hong Kong University of Science and Technology. Department of Computer Science. Technical Report HKUST-CS95-36. (1995).Google Scholar
  4. 4.
    I. Csiszár, “Simple Proofs of Some Theorems on Noiseless Channels,” Inform. Contr., bf 14 (1969) pp. 285–298CrossRefGoogle Scholar
  5. 5.
    I. Csiszár, G. Katona and G. Tsunády, “Information Sources with Different Cost Scales and the Principle of Conservation of Energy,” Z. Wahrscheinlichkeitstheorie verw, 12, (1969) pp. 185–222CrossRefGoogle Scholar
  6. 6.
    N. Cot, “Complexity of the Variable-length Encoding Problem,” Proceedings of the 6th Southeast Conference on Combinatorics, Graph Theory and Computing, (1975) 211–224.Google Scholar
  7. 7.
    M. L. Fredman and D. E. Knuth, “Recurrence Relations Based on Minimization,” Journal of Mathematical Analysis and Applications, 48 (1974) 534–559.CrossRefGoogle Scholar
  8. 8.
    M. Golin and G. Rote, “A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes for Unequal Letter Costs,” Proceedings of the 22nd International Colloquim on Automata Languages and Programming (ICALP '95), (July 1995).Google Scholar
  9. 9.
    M. Golin and H. Young, “Prefix Codes: Equiprobable Words, Unequal Letter Costs,” Proceedings of the 21st International Colloquium on Automata Languages and Programming (ICALP '94), (July 1994). Full version to appear in SIAM Journal on Computing.Google Scholar
  10. 10.
    Sanjiv Kapoor and Edward Reingold, “Optimum Lopsided Binary Trees,” Journal of the Association for Computing Machinery, 36 (3) (July 1989) 573–590.Google Scholar
  11. 11.
    R. Karp, “Minimum-Redundancy Coding for the Discrete Noiseless Channel,” IRE Transactions Information Theory, 7 (1961) 27–39.CrossRefGoogle Scholar
  12. 12.
    Ivan Niven, “Irrational Numbers,” Carus Mathematical Monographs, 11. The Mathematical Association of America, Washington D.C., 1956.Google Scholar
  13. 13.
    R. M. Krause, “Channels Which Transmit Letters of Unequal Duration,” Inform. Contr., 5 (1962) pp. 13–24CrossRefGoogle Scholar
  14. 14.
    Y. Perl, M. R. Garey, and S. Even. “Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters,” Journal of the Association for Computing Machinery, 22(2):202–214, April 1975.Google Scholar
  15. 15.
    Nicholas Pippenger, “An Elementary Approach to Some Analytic Asymptotics,” SIAM Journal of Mathematical Analysis, 24(5) (September 1993) 1361–1377.CrossRefGoogle Scholar
  16. 16.
    C.E. Shannon “A Mathematical Theory of Communication,” Bell System Technical Journal 27 (1948) 379–423, 623–656.Google Scholar
  17. 17.
    Serap A. Savari, “Some Notes on Varn Coding,” IEEE Transactions on Information Theory, 40(1) (Jan. 1994) pp. 181–186.CrossRefGoogle Scholar
  18. 18.
    B.F. Varn “Optimal Variable Length Codes (Arbitrary Symbol Costs and Equal Code Word Probabilities),” Informat. Contr., 19 (1971) pp. 289–301CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Vicky Siu-Ngan Choi
    • 1
  • Mordecai Golin
    • 1
  1. 1.Hong Kong University of Science and TechnologyKowloonHong Kong

Personalised recommendations