Finite Completion of comma-free codes Part 2
Hanoi Institute of Mathematics, 18 Hoang Quoc Viet Road, 10 307 Hanoi, Vietnam; email@example.com.
Accepted: 10 February 2004
This paper is a sequel to an earlier paper of the present author, in which it was proved that every finite comma-free code is embedded into a so-called (finite) canonical comma-free code. In this paper, it is proved that every (finite) canonical comma-free code is embedded into a finite maximal comma-free code, which thus achieves the conclusion that every finite comma-free code has finite completions.
Mathematics Subject Classification: 68R15 / 68S05
Key words: Comma-free code / completion / finite maximal comma-free code.
© EDP Sciences, 2004