Photo by cliqueimages from unsplash
A run of length k in a sequence of n bits (0, 1) is an equal bits string preceded or succeeded by a different bit (or none). In this paper… Click to show full abstract
A run of length k in a sequence of n bits (0, 1) is an equal bits string preceded or succeeded by a different bit (or none). In this paper a computational algorithm for calculating the exact amount of binary sequences of length n, containing at least one run of length k (k ≤ n) is presented. The immediate application of this algorithm is to calculate the exact probability distribution of the number of n-bit sequences with containing at least one run of length k, and no one greater than k, for use for example as part of a test for randomness
Keywords:
least one;
one run;
run length;
bit
Journal Title: IEEE Latin America Transactions
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: IEEE Latin America Transactions
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!