Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-15T17:56:00.903Z Has data issue: false hasContentIssue false

Finite Completion of comma-free codes Part 2

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 a sequel to anearlier paper of the present author, in which it was proved thatevery 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-freecode, which thus achieves the conclusion that every finite comma-freecode has finite completions.


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