Abstract
A k-constrained run-length-limited binary sequence is a string of zeros and ones containing no substrings of full of zeros longer than k. The authors denote the number of such sequences of length n with S/sub k/(n). They start from the work of Tang and Bahl (1970). They discuss the distribution of waiting time for runs of given length. They then give practical corollaries and a theoretical corollary. >
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.
