Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T01:17:32.937Z Has data issue: false hasContentIssue false

Finite Completion of comma-free codesPart 1

Published online by Cambridge University Press:  15 June 2004

Nguyen Huong Lam*
Affiliation:
Hanoi Institute of Mathematics, 18 Hoang Quoc Viet Road, 10 307 Hanoi, Vietnam; nhlam@math.ac.vn.
Get access

Abstract

This paper is the first step in thesolution of the problem of finite completion of comma-free codes.We show that every finite comma-free code is included in afinite comma-free code of particular kind, which we called, for lack of a better term, canonical comma-free code. Certainly, finite maximal comma-free codesare always canonical. The final step of the solution which consistsin proving further that every canonical comma-free code is completedto a finite maximal comma-free code, is intended to be published in a forthcomingpaper.

Information

Type
Research Article
Copyright
© EDP Sciences, 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable