On the expected duration of a search for a fixed pattern in random data (Corresp.)

P Nielsen

doi:10.1109/tit.1973.1055064

On the expected duration of a search for a fixed pattern in random data (Corresp.)

P Nielsen

https://doi.org/10.1109/tit.1973.1055064

Copy DOI

Journal: IEEE Transactions on Information Theory	Publication Date: Sep 1, 1973
Citations: 62

Affiliation: Technical University of Denmark

#Ary Sequence #Pattern In Random Data + Show 3 more

Abstract
Full-Text
Similar Papers

Abstract

An expression is obtained for the expected duration of a search to find a given <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">L</tex> -ary sequence in a semi-infinite stream of random <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">L</tex> -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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

More From: IEEE Transactions on Information Theory

Paper Title

Journal

Date

Author

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.