𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Completing comma-free codes

✍ Scribed by Nguyen Huong Lam


Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
248 KB
Volume
301
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

✦ Synopsis


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.


πŸ“œ SIMILAR VOLUMES


Varieties of comma-free codes
✍ Christian J. Michel; Giuseppe Pirillo; Mario A. Pirillo πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 202 KB

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-f

Combinatorial problems motivated by comm
✍ 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.

Complementary coding conforms to the pri
✍ 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