Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Comma-free code

A comma-free code is block code in which no concatenation of two code words contains a valid code word that overlaps both. Comma-free codes are also… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
In channels that introduce substitution, insertion, and deletion errors, one challenging problem for a code designer to overcome… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 8
2017
2017
A two-dimensional code of pictures is defined as a set X ź Σ * * such that any picture over Σ is tilable in at most one way with… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
2008
2008
The comma-free codes and circular codes are two important classes of codes in code theory and in genetics. Fifty years ago before… Expand
  • figure 4
  • table 2
  • table 3
  • table 4
  • table 4
2004
2004
  • N. Lam
  • RAIRO Theor. Informatics Appl.
  • 2004
  • Corpus ID: 39563696
This paper is a sequel to an earlier paper of the present author, in which it was proved that every finite comma-free code is… Expand
2004
2004
  • N. Lam
  • RAIRO Theor. Informatics Appl.
  • 2004
  • Corpus ID: 22477483
This paper is the first step in the solution of the problem of finite completion of comma-free codes. We show that every finite… Expand
2003
2003
  • N. Lam
  • Theor. Comput. Sci.
  • 2003
  • Corpus ID: 18890815
We prove that for every regular comma-free code there exists a maximal comma-free code containing it which is still regular and… Expand
1983
1983
The definition of comma-free codes is extended to be more comprehensive and include codes with variable length codewords and… Expand
  • table 1
  • table 6
  • table 7
1981
1981
are not in C. When such a code is used for transmission of a message over a noiseless channel word synchronization can be… Expand
  • table I
1973
1973
  • Yoji Niho
  • IEEE Trans. Inf. Theory
  • 1973
  • Corpus ID: 35182415
In this correspondence a binary maximal comma-free code for words of length 10 and the search technique used to construct it are… Expand
1967
1967
New classes of codes with similar application to Gilbert's code [1] are defined. Weakening of his synchronizing condition gives… Expand
  • table I
  • figure 1