DocumentCode
920038
Title
On the expected duration of a search for a fixed pattern in random data (Corresp.)
Author
Nielsen, P. Tolstrup
Volume
19
Issue
5
fYear
1973
fDate
9/1/1973 12:00:00 AM
Firstpage
702
Lastpage
704
Abstract
An expression is obtained for the expected duration of a search to find a given 
-ary sequence in a semi-infinite stream of random -ary data. The search time is found to be an increasing function of the lengths of the "bifices" of the pattern, where the term bifix denotes a sequence which is both a prefix and a suffix.
-ary sequence in a semi-infinite stream of random -ary data. The search time is found to be an increasing function of the lengths of the "bifices" of the pattern, where the term bifix denotes a sequence which is both a prefix and a suffix.Keywords
Frame synchronization; Pattern recognition; Sequences; Synchronization; Circuit theory; Digital communication; Hydrogen; Pattern analysis; Probability; Random sequences; Random variables; Statistics; Telecommunications; Tin;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1973.1055064
Filename
1055064
Link To Document