Abstract
A 4-ary run-length limited (RLL) code with minimum run-length constraint d = 1 and maximum run-length constraint k = 2 is presented. The proposed code can be represented by a finite state diagram with two states. This is the lowest number of states necessary for representing the code yet presented. A simple docoding rule for the code is also introduced and a scheme for reducing the DC content of the coded sequence in the sense of multilevel running digital sum (RDS) is discussed.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
