On the Lifetime of a Random Binary Sequence
No Thumbnail Available
Date
2011
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier Science Bv
Open Access Color
OpenAIRE Downloads
OpenAIRE Views
Abstract
Consider a system with m elements which is used to fulfill tasks. Each task is sent to one element which fulfills a task and the outcome is either fulfillment of the task ("1") or the failure of the element ("0"). Initially, m tasks are sent to the system. At the second step, a complex of length m(1) is formed and sent to the system, where m(1) is the number of tasks fulfilled at the first step, and so on. The process continues until all elements fail and the corresponding waiting time defines the lifetime of the binary sequence which consists of "1" or "0". We obtain a recursive equation for the expected value of this waiting time random variable. (C) 2011 Elsevier B.V. All rights reserved.
Description
Keywords
Binary sequence, Markov chain, Waiting time
Turkish CoHE Thesis Center URL
Fields of Science
Citation
WoS Q
Q3
Scopus Q
Q2
Source
Volume
159
Issue
15
Start Page
1646
End Page
1649