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
β Scribed by Bob Neveln
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 277 KB
- Volume
- 144
- Category
- Article
- ISSN
- 0022-5193
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
## 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.
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