One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage Plus
Audio Papers
Ask R Discovery
Translation
Auto-sync
Collaboration
Open Accesshttps://doi.org/10.1016/s0019-9958(77)80011-9
Copy DOI
Export
Save
Share
Cite Journal: Information and Control |  Publication Date: Jun 1, 1977 |
 Citations: 34 |  License type: publisher-specific-oa |
Affiliation: Shizuoka University
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.
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
