Constrained Embedding Probability for Two Binary Strings

DOI10.1137/S0895479894246917MaRDI QIDQ4895627zbMATH OpenOpenAlexFDO

Authors J. Dj. Golić

Publication date 12 January 1998

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895479894246917

zbMATH Keywords

cryptanalysisbinary stringrecurrencessequence comparisonsynchronization error-correcting codesconstrained embedding

Mathematics Subject Classification ID

Cryptography (94A60) Exact enumeration problems, generating functions (05A15) Recurrences (11B37) Synchronization error-correcting codes (94B50)

Recommendations

• Bounds for the probability of a constrained embedding of one discrete sequence into another
• On a Conjecture about Binary Strings Distribution
• Markovian embeddings of general random strings
• Limit probabilities for random sparse bit strings
• A Note on the Probability of Rectangles for Correlated Binary Strings
• Combinatorial version of the Slepian-Wolf coding theorem for binary strings
• Detection of embeddings in binary Markov chains
• On a problem of probabilistic-statistical analysis of embeddings in a binary Markov chain.
• scientific article; zbMATH DE number 1136073

Cited in

(4)

• On the number of coincidences of two homogeneous random walks with positive increments
• Bounds for the probability of a constrained embedding of one discrete sequence into another
• Limit theorems for the number of dense series in a random sequence
• A cryptanalysis of clock-controlled shift registers with multiple steps

This page was built for publication: Constrained Embedding Probability for Two Binary Strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895627)