Abstract
An alphabetic code is a code such that the order of codeword sequences coincides with the alphabetic order of source sequences. If we use one code tree, the optimal alphabetic code attaining the minimum average code length can be constructed by the Hu- Tucker algorithm. In this paper, we show that an efficient alphabetic AIFV (almost instantaneous fixed-to-variable length) code can be constructed by using three code trees and allowing at most two-bit decoding delay, and we propose a simple method to construct an alphabetic AIFV code from the Hu- Tucker code tree so that the alphabetic AIFV code can attain better compression rate than the Hu- Tucker code.
Sign-in/Register to access full text options 
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 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.
