Constrained embedding probability for two binary strings

SIAM Journal on Discrete Mathematics

Volumn 9, Issue 3, 1996, Pages 360-364

  Golic, Jovan Dj ^a,b  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

^b School of Electrical Engineering University of Belgrade

Author keywords

Constrained embedding; Cryptanalysis; Recurrences; Sequence comparison; Synchronization error correcting codes

Indexed keywords

RANDOM PROCESSES;

ANALYTICAL METHOD; ERROR CORRECTING CODE; SEQUENCE;

COMBINATORIAL MATHEMATICS;

EID: 0030365319     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479894246917     Document Type: Article

References (5)

1. L. CALABI AND W. E. HARTNETT, Some general results of coding theory with applications to the study of codes for the correction of synchronization errors, Inform. and Control, 15 (1969), pp. 235-249.
2. A. S. DOLGOPOLOV, Capacity bounds for a channel with synchronization errors, Prob. Peredachi Inform., 26 (1990), pp. 27-37. (In Russian.)
3. J. DJ. GOLIĆ AND M. J. MIHALJEVIĆ, A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance, J. Cryptology, 3 (1991), pp. 201-212.
4. D. SANKOFF AND J. B. KRUSKAL, Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, Addison-Wesley, Reading, MA, 1983.
5. M. V. Z̃IVKOVIĆ, An algorithm for the initial state reconstruction of the clock-controlled shift register, IEEE Trans. Inform. Theory, 37 (1991), pp. 1488-1490.