Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

2 results

  • Finite Completion of comma-free codesPart 1

  • Nguyen Huong Lam
  • Journal:
    RAIRO - Theoretical Informatics and Applications / Volume 38 / Issue 2 / April 2004
    Published online by Cambridge University Press:
    15 June 2004, pp. 91-115
    Print publication:
    April 2004

  • 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.

  • Finite Completion of comma-free codes Part 2

  • Nguyen Huong Lam
  • Journal:
    RAIRO - Theoretical Informatics and Applications / Volume 38 / Issue 2 / April 2004
    Published online by Cambridge University Press:
    15 June 2004, pp. 117-136
    Print publication:
    April 2004

  • 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.