Alphabetic codes revisited

@article{Yeung1991AlphabeticCR,
  title={Alphabetic codes revisited},
  author={Raymond W. Yeung},
  journal={IEEE Trans. Information Theory},
  year={1991},
  volume={37},
  pages={564-572}
}
An alphabetic code for an ordered probability distribution ( p k ) is a prefix code in which Pk is assigned to the kth codeword of the coding tree in the left-to-right order. This class of codes is applied to binary test problems. Many previous 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 k ) is in ascending or descending order, Lmi… CONTINUE READING