RAIRO-Theor. Inf. Appl.
Volume 38, Number 2, April-June 2004
|Page(s)||91 - 115|
|Published online||15 June 2004|
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
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.