Skip to main content

Path map symbol release algorithms and the exponential metric tree

  • Conference paper
  • First Online:
Book cover Advances in Communications and Signal Processing

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 129))

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. M. Gray, “Time-invariant trellis encoding of ergodic discrete-time sources with a fidelity criterion,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 71–83, Jan. 1977.

    Google Scholar 

  2. J. B. Bodie, “Multi-path tree encoding for analog data sources,” Commu. Res. Lab., McMaster Univ., Hamilton, O.N., Canada, CRL Internal Rept. Series CRL-20, June 1974.

    Google Scholar 

  3. A. C. Goris and J. D. Gibson, “Incremental Tree Coding of Speech,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 511–516, July 1981.

    Google Scholar 

  4. A. M. Mood and F. A. Graybill, Introduction to the Theory of Statistics, Second edition, McGraw-Hill, New York, 1963.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

William A. Porter Subhash C. Kak

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag

About this paper

Cite this paper

Chang, W.W., Gibson, J.D. (1989). Path map symbol release algorithms and the exponential metric tree. In: Porter, W.A., Kak, S.C. (eds) Advances in Communications and Signal Processing. Lecture Notes in Control and Information Sciences, vol 129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0042728

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51424-4

  • Online ISBN: 978-3-540-46259-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics