On the construction of maximal prefix-synchronized codes

IEEE Transactions on Information Theory

Volumn 42, Issue 6 PART 2, 1996, Pages 2158-2166

  Morita, Hiroyoshi ^a,b   Van Wijngaarden, Adriaan J ^c   Han Vinck, A J ^a,c  

^a IEEE

^b UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

^c UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

Comma free codes; Fibonacci codes; Fibonacci sequences; Frame synchronization; Prefix synchronized codes; Runlength limited codes; Synchronization

Indexed keywords

EID: 0000850369     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.556604     Document Type: Article

References (15)

1. S.W. Golomb, B. Gordon, and L. R. Welch, "Comma-free codes," Can. J. Math., vol. 10, pp. 202-209, 1958.
2. W. L. Eastman, "On the construction of comma-free codes," IEEE Trans. Inform. Theory, vol. IT-11, pp. 263-266, 1965.
3. R. A. Scholtz, "Maximal and variable word-length comma-free codes," IEEE Trans. Inform. Theory, vol. IT-15, pp. 300-306, 1969.
4. E. N. Gilbert, "Synchronization of binary messages," IRE Trans. Inform. Theory, vol. IT-6, pp. 470-477, 1960.
5. L. J. Guibas and A. M. Odlyzko, "Maximal prefix-synchronized codes," SIAM J. Appl. Math., vol. 35, pp. 401-418, Sept. 1978.
6. D. M. Mandelbaum, "Synchronization of codes by means of Kautz's Fibonacci encoding," IEEE Trans. Inform. Theory, vol. IT-18, pp. 281-285, Mar. 1972.
7. W. H. Kautz, "Fibonacci codes for synchronization control," IEEE Trans. Inform. Theory, vol. IT-11, pp. 284-292, 1965.
8. D. T. Tang and L. R. Bahl, "Block codes for a class of constrained noiseless channels," Inform. Contr., vol. 17, pp. 436-461, 1970.
9. G. F. M. Beenker and K. A. S. Immink, "A generalized method for encoding and decoding runlength-limited binary sequences," IEEE Trans. Inform. Theory, vol. IT-29, pp. 751-754, Sept. 1983.
10. K. A. S. Immink and H. D. L. Hollmann, "Prefix-synchronized run-length-limited sequences," IEEE J. Sel. Areas Commun., vol. 10, pp. 214-222, Jan. 1992.
11. R. M. Capocelli, "Comments and additions to 'Robust transmission of unbounded strings using Fibonacci representations'," IEEE Trans. Inform. Theory, vol. 35, pp. 191-193, Jan. 1989.
12. H. Yamamoto and H. Ochi, "A new asymptotically optimal code for the positive integers," IEEE Trans. Inform. Theory, vol. 37, pp. 1420-1429, Sept. 1991.
13. L. J. Guibas and A. M. Odlyzko, "String overlap, pattern matching and nontransitive games," J. Comb. Theory, vol. 30, ser. A, pp. 183-208, 1981.
14. R. A. Scholtz, "Frame synchronization techniques," IEEE Trans. Commun., vol. COM-28, pp. 1204-1213, 1980.
15. G. A. Stephen, String Searching Algorithm, vol. 3 of Lecture Notes Series on Computing. Singapore: World Scientific, 1994.