Skip to main content
SpringerLink
Log in

Optimality of right leaning trees

  • Variable Length Coding
  • Conference paper
  • First Online:
Coding Theory and Applications (Coding Theory 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 311))

Included in the following conference series:

  • 144 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akdag, H.: Performances of an algorithm constructing a nearly optimal binary tree, Acta Informatica 20, 183.

    Google Scholar 

  2. Akdag, H., Bouchon B.: Right leaning trees with a pseudo-huffmanian length, IEEE Int. Symposium. on Inform. Theory, Ann Arbor, 1986.

    Google Scholar 

  3. Darwiche, J.: Construction de questionnaires arborescents quasi-optimaux, Thèse de 3ème Cycle, Université Paris VI, 1985.

    Google Scholar 

  4. Johnsen, O.: On the redundancy of binary Huffman codes, IEEE Transactions on Inform. Theory 26, 2, 1980.

    Google Scholar 

  5. Gallager, R.G.: Variations on a theme by Huffman, IEEE Transactions on Inform, Theory 24, 6, 1978.

    Google Scholar 

  6. Garey, M.R., Graham R.L.: Performance Bounds on the splitting algorithm for binary testing, Acta Informatica 3, 1974.

    Google Scholar 

  7. Payne, R.W., Preece, D.A.: Identification keys and diagnostic tables, a review, J. Roy. Statis. Soc., Ser. A, 1980.

    Google Scholar 

  8. Picard C.F.: Graphs and questionnaires, North Holland, Amsterdam, 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS - LAFORIA, Université Paris VI - Tour 45, 4 place Jussieu, 75252, Paris Cédex 05, France

    Herman Akdag & Bernadette Bouchon

Authors
  1. Herman Akdag
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernadette Bouchon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

G. Cohen P. Godlewski

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Akdag, H., Bouchon, B. (1988). Optimality of right leaning trees. In: Cohen, G., Godlewski, P. (eds) Coding Theory and Applications. Coding Theory 1986. Lecture Notes in Computer Science, vol 311. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19368-5_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-19368-5_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19368-5

  • Online ISBN: 978-3-540-39243-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation