Name
Abstract | ||
|---|---|---|
In this paper, we introduce the notion of k-comma codes - a proper generalization of the notion of comma-free codes. For a given positive integer k, a k-comma code is a set L over an alphabet Σ with the property that LΣ kL ∩ Σ +LΣ + = ∅. Informally, in a k-comma code, no codeword can be a subword of the catenation of two other codewords separated by a “comma” of length k. A k-comma code is indeed a code, that is, any sequence of codewords is uniquely decipherable. We extend this notion to that of k-spacer codes, with commas of length less than or equal to a given k. We obtain several basic properties of k-comma codes and their generalizations, k-comma intercodes, and some relationships between the families of k-comma intercodes and other classical families of codes, such as infix codes and bifix codes. Moreover, we introduce the notion of n-k-comma intercodes, and obtain, for each k ≥ 0, several hierarchical relationships among the families of n-k-comma intercodes, as well as a characterization of the family of 1-k-comma intercodes. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.3233/FI-2011-390 | Fundam. Inform. |
Keywords | Field | DocType |
n-k-comma intercodes,bifix code,1-k-comma intercodes,k-comma intercodes,k-spacer code,comma-free code,k-comma code,length k,infix code,k-comma codes,positive integer k | Integer,Discrete mathematics,Combinatorics,Generalization,Infix,Code word,Catenation,Code (cryptography),Mathematics,Alphabet | Journal |
Volume | Issue | ISSN |
107 | 1 | 0169-2968 |
Citations | PageRank | References |
9 | 0.61 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bo Cui | 1 | 53 | 4.07 |
| Lila Kari | 2 | 1123 | 124.45 |
| Shinnosuke Seki | 3 | 189 | 29.78 |