Abstract
In the present invention asymmetric run length constraints with different minimum run lengths for first and second patterns representing binary data are introduced, like dm=0 for the first pattenr, i.e. shortest sequence of first patterns is equal to the bit period, and ds>0 for the second pattern, i.e. shortest sequence of second patterns is equal to d+1 bit periods. Thereby, the small 'cost' of a reduced code rate will be more than compensated by a large increase in power margin.
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.
