Finite Completion of comma-free codes Part 1
Hanoi Institute of Mathematics, 18 Hoang Quoc Viet Road, 10 307 Hanoi, Vietnam; firstname.lastname@example.org.
Accepted: 10 February 2004
This paper is the first step in the solution of the problem of finite completion of comma-free codes. We show that every finite comma-free code is included in a finite comma-free code of particular kind, which we called, for lack of a better term, canonical comma-free code. Certainly, finite maximal comma-free codes are always canonical. The final step of the solution which consists in proving further that every canonical comma-free code is completed to a finite maximal comma-free code, is intended to be published in a forthcoming paper.
Mathematics Subject Classification: 68R15 / 68S05
Key words: Comma-free code / completion / finite maximal comma-free code.
© EDP Sciences, 2004