Abstract
We describe a data structure for compactly storing binary alphabetic code trees that also allows the encoding and decoding processes to be carried out efficiently. Asymptotically, less than 4n bits are needed to store an alphabetic code tree for an n-symbol source. Moreover, encoding and decoding times are proportional to the length of the compressed data. Summary It is well known that the number of binary trees with n terminal nodes is 92n-2
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.