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

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call