Abstract

A prefix code X is said to satisfy the (d, k) runlength-limited (RLL) constraint if all the possible concatenations of the codewords of X satisfy the (d, k) RLL constraint. In this paper, the problem of constructing a minimum expected length prefix code satisfying the (d, k) RLL constraint is studied for certain (d, k) pairs. The question of maximality, with maximality defined relative to the RLL constraint, of these optimal prefix codes is also taken up and answered for some cases.

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.