Skip to main content
Springer Nature Link
Log in

On binary tree encodements⋆

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

A data encoding scheme involving binary tree encodements is presented and analyzed. A closed-form formula for the number of n-bit legal memory configurations is developed. It is shown that the storage capacity loss due to the use of this scheme is not significant for large n.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Brualdi, R.A.: Introductory combinatorics. Amsterdam: North Holland 1979

    Google Scholar 

  2. Cox, J.R., Kimura, T.D., Moore, P., Gillett, W.D., Stucki, M.J.: Design studies suggested by an abstract model for a medical information system. In: Proceedings of the Fourth Annual Symposium on Computer Applications in Medical Care (J.T. O'Neill, ed.) Vol: 3, pp. 1485–1494, Washington, D.C., November, 1980

  3. Eisen, M.M.: Elementary combinatorial analysis. New York: Gordon & Breach 1969

    Google Scholar 

  4. Even, S.: Graph algorithms. Potomac: Computer Science Press, 1979

    Google Scholar 

  5. Fano, R.M.: Transmission of information. New York: John Wiley and Sons, Inc. and MIT Press 1961

    Google Scholar 

  6. Galleger, R.G.: Information theory and reliable communication. New York: John Wiley and Sons, Inc. 1968

    Google Scholar 

  7. Gillett, W.D.: The number of binary trees. Technical Report No. WUCS-81-5, Department of Computer Science, Washington University, August 1981

  8. Jolley, L.B.W.: Summation of series. Dover Publications 1961

  9. Kimura, T.D., Cox, J.R., Gillett, W.D.: An abstract model of an unstratified database system. In: Proceedings of the Fourteenth Hawaii International Conference on Systems Science (W. Riddle, K. Thurber, R.H. Sprague, eds.) Vol. 1, pp. 115–126. Honolulu, Hawaii, January 1981

  10. Kimura, T.D., Gillett, W.D.: Formal specifications of ADS, an abstract database system. Technical Report No. WUCS-81-3, Department of Computer Science, Washington University, May 1981

  11. Knuth, D.E.: The art of computer programming: Fundamental algorithms, Vol.1 (2nd ed.). Reading, Mass: Addison-Wesley 1973

    Google Scholar 

  12. Lueker, G.S.: Some techniques for solving recurrences. ACM Comput. Surveys 12(4), 419–436 (1980)

    Google Scholar 

  13. Stanley, R.P.: Generating functions. MAA Studies in Mathematics, Vol. 17: Studies in Combinatorics (G.-C. Rota, ed.). The Mathematical Association of America, pp. 100–141, 1978

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Washington University, 63130, St. Louis, MO, USA

    Will D. Gillett

Authors
  1. Will D. Gillett
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

This work was supported in part under the NCHSR Grant HS03792 and the NIH Grant R R00396

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gillett, W.D. On binary tree encodements⋆. Acta Informatica 21, 183–192 (1984). https://doi.org/10.1007/BF00289239

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00289239

Keywords