Abstract
A new sufficient condition is given for an infinite source distribution to share a minimum average codeword length code with the geometric distribution. Thus, some new examples of parametric families of infinite source distributions can be optimally encoded by Huffman-type codes.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
