Abstract
An alphabetic code for an ordered probability distribution (P/sub k/) is a prefix code in which P/sub k/ is assigned to the kth codeword of the coding tree in left-to-right order. This class of codes is applied to binary test problems. Several earlier results on alphabetic codes are unified and enhanced. The characteristic inequality for alphabetic codes that is analogous to the Kraft inequality for prefix codes is also derived. It is shown that if (P/sub k/) is in ascending or descending order, L/sub min,/ the expected length of an optimal alphabetic code, is the same as that of a Huffman code for the unordered distribution (P/sub k/). An enhancement of Gilbert and Moore's (1959) merging property of all optimal alphabetic code is proved. Two lower bounds and a new upper bound on the expected length of an optimal alphabetic code are also proven, and a simple method is proposed for constructing good alphabetic codes when optimality is critical. >
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.
