Abstract
Purchase PDF (248 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (0)
Purchase PDF (202 K)
doi:10.1016/S0304-3975(02)00595-9 
Copyright © 2002 Published by Elsevier Science B.V.
Completing comma-free codes
Nguyen Huong Lam
Received 6 April 2001;
revised 25 July 2002;
accepted 20 August 2002;
Communicated by M. Ito
Available online 1 February 2003.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
We prove that for every regular comma-free code there exists a maximal comma-free code containing it which is still regular and, moreover, we can effectively locate such a completion. In particular, we can decide whether a given regular comma-free code is maximal.
Author Keywords: Comma-free codes; Completion; Regular maximal comma-free codes
