Maximal Prefix-Synchronized Codes
From MaRDI portal
Publication:4177474
DOI10.1137/0135034zbMath0394.94024MaRDI QIDQ4177474
Leonidas J. Guibas, Andrew M. Odlyzko
Publication date: 1978
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0135034
94A45: Prefix, length-variable, comma-free codes
Related Items
Where to place a hole to achieve a maximal escape rate, Frequency of symbol occurrences in bicomponent stochastic models, Synchronization and simplification, String matching and 1d lattice gases, Multiple pattern matching: a Markov chain approach, A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials, Deviations from uniformity in random strings, The use and usefulness of numeration systems, String overlaps, pattern matching, and nontransitive games, Periodic oscillations of coefficients of power series that satisfy functional equations, Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach, On pattern occurrences in a random text, Robust universal complete codes for transmission and compression, Pattern statistics and Vandermonde matrices., Circular codes, loop counting, and zeta-functions, Long repetitive patterns in random sequences
