Abstract
An improved upper bound is obtained on the averaged path length of an alphabetical binary tree (or equivalently on the averaged word length of the alphabetical binary code) which is constructed by weight balancing.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
