Title :
On the distribution of waiting time for runs of given length
Author_Institution :
Dept. of Telecommun. & Telematics, Tech. Univ. Budapest, Hungary
fDate :
27 Jun-1 Jul 1994
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 Sk (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
Keywords :
binary sequences; runlength codes; k-constrained run-length-limited binary sequence; substrings; waiting time; Binary sequences; Block codes; Channel capacity; Difference equations; Polynomials; Telematics; Upper bound;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.394789
