Loading [a11y]/accessibility-menu.js
On redundancy of coding using binary tree decomposition | IEEE Conference Publication | IEEE Xplore

On redundancy of coding using binary tree decomposition


Abstract:

We present an estimation of the redundancy of source coding using symbol binarization as a function of the decomposition tree and binary coding technique.

Abstract:

We present an estimation of the redundancy of source coding using symbol binarization as a function of the decomposition tree and binary coding technique.
Date of Conference: 25-25 October 2002
Date Added to IEEE Xplore: 06 January 2003
Print ISBN:0-7803-7629-3
Conference Location: Bangalore, India

Contact IEEE to Subscribe

References

References is not available for this document.