Counting Runs of Ones and Ones in Runs of Ones in Binary Strings.docVIP

Open Journal of Applied Sciences Supplement： 2012 world Congress on Engineering and Technology Counting Runs of Ones and Ones in Runs of Ones in Binary Strings Counting runs in binary strings Frosso S. Makri, Zaharias M. Psillakis, Nikolaos Kollas Departments of Mathematics and Physics University of Patras Patras, Greece makri@math.upatras.gr; psillaki@physics.upatras.gr Abstract—Consider a binary string (a symmetric Bernoulli sequence) of length ?. For a positive integer ?, 1 ≤ ? ≤ ?, we exactly enumerate, in all 2? possible binary strings of length ?, the number of all runs of 1s of length (equal, at least) ? and the number of 1s in all runs of 1s of length at least ?. To solve these counting problems, we use probability theory and we obtain simple and easy to compute explicit formulae as well as recursive schemes, for these potential useful in engineering numbers. Keywords-runs; symmetric Bernoulli trials; probability theory; combinatorial problems contributions on the subject, among others, are the works of [9] – [22]. 1. Introduction and Preliminaries Nowadays, the increasing use of the computer science in Let {? } be a sequence of binary (two-state) random variables (RVs) taking on the values zero (0) or one (1) ordered on a line. According to Mood’s [23] enumeration scheme a run of 1s (1-run) is defined to be a sequence of consecutive 1s preceded and succeeded by 0s or by nothing. The number of 1s in a 1-run is referred to as its length (or size). For a positive diverse applications including encoding, compression and transmission of digital information calls for understanding the distribution of runs of 1s or 0s. For instance, such knowledge would help in analyzing, and comparing also, several techniques used in communication networks (wired or wireless). In such networks binary data, ranging from a few bytes (e.g. e-mails) to many