Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

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… 
2017
2017
2010
2010
In this paper, we investigate the inclusion relation among familes of codes under the pure codes and the bifix codes. The family… 
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… 
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… 
2003
2003
  • N. Lam
  • Theor. Comput. Sci.
  • 2003
  • Corpus ID: 18890815
1988
1988
Abstract : Data compression codes offer the possibility of improving the thruput of existing communication systems in the near… 
1983
1983
The definition of comma-free codes is extended to be more comprehensive and include codes with variable length codewords and… 
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… 
1967
1967
New classes of codes with similar application to Gilbert's code [1] are defined. Weakening of his synchronizing condition gives…