Maximal Prefix-Synchronized Codes
- 1 September 1978
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 35 (2) , 401-418
- https://doi.org/10.1137/0135034
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- String overlaps, pattern matching, and nontransitive gamesJournal of Combinatorial Theory, Series A, 1981
- Periods in stringsJournal of Combinatorial Theory, Series A, 1981
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- Mathematical GamesScientific American, 1974
- A note on bifix-free sequences (Corresp.)IEEE Transactions on Information Theory, 1973
- Maximal and variable word-length comma-free codesIEEE Transactions on Information Theory, 1969
- On the construction of comma-free codesIEEE Transactions on Information Theory, 1965
- Regent Results in Comma-Free CodesCanadian Journal of Mathematics, 1963
- Synchronization of binary messagesIEEE Transactions on Information Theory, 1960
- Comma-Free CodesCanadian Journal of Mathematics, 1958