Abstract
A depth-first algorithm is presented for the construction of a binary minimum-redundancy variable length code with limited word length. In this algorithm, heuristic information on the mean word length is used for efficient searching. The extension to Q -ary codes is also discussed.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
