✦ LIBER ✦

On maximal comma-free codes (Corresp.)

✍ Scribed by Niho, Y.

Book ID: 114634122
Publisher: IEEE
Year: 1973
Tongue: English
Weight: 333 KB
Volume: 19
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.1973.1055022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A construction method for path-invariant

A construction method for path-invariant comma-free codes (Corresp.)

✍ Imai, H. 📂 Article 📅 1974 🏛 IEEE 🌐 English ⚖ 779 KB

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.

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

Comma-free and synchronizable codes

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

Reinforced prefixed comma-free codes

✍ Ramamoorthy, C.; Tufts, D. 📂 Article 📅 1967 🏛 IEEE 🌐 English ⚖ 871 KB

Path-invariant comma-free codes

✍ Kendall, W. ;Reed, I. 📂 Article 📅 1962 🏛 IEEE 🌐 English ⚖ 646 KB