✦ LIBER ✦

Varieties of comma-free codes

✍ Scribed by Christian J. Michel; Giuseppe Pirillo; Mario A. Pirillo

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 202 KB
Volume: 55
Category: Article
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2006.12.091

No coin nor oath required. For personal study only.

✦ Synopsis

New varieties of comma-free codes CFC of length 3 on the 4-letter alphabet are defined and analysed: self-complementary comma-free codes (CCFC), C 3 comma-free codes (C 3 CFC), C 3 self-complementary comma-free codes (C 3 CCFC), selfcomplementary maximal comma-free codes (CMCFC), C 3 maximal comma-free codes (C 3 MCFC) and C 3 self-complementary maximal comma-free codes (C 3 CMCFC). New properties with words of length 3, 4, 5 and 6 in comma-free codes are used for the determination of growth functions in the studied code varieties.

📜 SIMILAR VOLUMES

Completing comma-free codes

✍ Nguyen Huong Lam 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 248 KB

We prove that for every regular comma-free code there exists a maximal comma-free code containing it which is still regular and, moreover, we can e ectively locate such a completion. In particular, we can decide whether a given regular comma-free code is maximal.

Comma-free and synchronizable codes

✍ Bob Neveln 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 277 KB

Combinatorial problems motivated by comm

Combinatorial problems motivated by comma-free codes

✍ Vladimir I. Levenshtein 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

## Abstract In the paper some combinatorial problems motivated by comma‐free codes are considered. We describe these problems, give the most significant known results and methods used, present some new results and formulate open problems. © 2004 Wiley Periodicals, Inc.

Generalized Witt formulae and comma-free

Generalized Witt formulae and comma-free codes

✍ J.N. Ridley; M.E. Mays 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 497 KB

Comma-free codes: An extension of certai

Comma-free codes: An extension of certain enumerative techniques to recursively defined sequences

✍ J.S Devitt; D.M Jackson 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 682 KB

Complementary coding conforms to the pri

Complementary coding conforms to the primeval comma-less code

✍ Jaromir Konecny; Michael Schöniger; Ludwig G. Hofacker 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 452 KB

The hypothesis that the universal genetic code is adapted to double-strand coding is supported by its remarkable compatibility with the RNY comma-less hypothesis. Coding by a triplet code on a polynucleotide double-strand allows for enciphering of five additional messages with reference to a chosen