Abstract

The codeword lengths of a maximal prefix code with minimum length among those with a given number of codewords differ by at most one. This paper studies the length of the optimal maximal prefix code with a given number N of codewords and the additional constraint that the difference of the lengths of the longest and shortest codeword must be equal to a given parameter Delta . An optimal algorithm is given that, for all N and Delta , constructs an (N, Delta )-MPC of minimum length. Then a lower bound is given for the length of the optimal (N, Delta )-MPC for Delta >

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

Disclaimer: 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.