Comma-Free Codes

1958/01/01 by S. W. Golomb, Basil Gordon, L. R. Welch · 9 citations
Computer Science · Engineering · #semigroups and automata theory #Coding theory and cryptography #graph theory and CDMA systems

paper · pdf · doi:10.4153/cjm-1958-023-9

Abstract

Let n be a fixed positive integer, and consider an alphabet consisting of the numbers 1, 2, … , n . With this alphabet form all possible k -letter words ( a 1 a 2 … a k ), where k is also fixed. There are evidently n k such words in all.

Cited by

• Symmetry types of periodic sequences
• Improved Singleton bound on frequency hopping sequences and optimal constructions
• Disjoint difference families and their applications
• The maximum independent sets of de Bruijn graphs of diameter 3
• Codon Distribution in Error-Detecting Circular Codes. [europepmc]
• The Relation Between k-Circularity and Circularity of Codes. [europepmc]
• Equivalence classes of circular codes induced by permutation groups. [europepmc]
• A role for circular code properties in translation. [europepmc]
• Forbidden codon combinations in error-detecting circular codes. [europepmc]

Related

• On the 3/4-Conjecture for Fix-Free Codes -- A Survey
• There exist infinite cube-free words over any sequence of binary alphabets
• More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
• New Multiple Insertion-Deletion Correcting Codes for Non-Binary Alphabets
• The Comma Sequence: A Simple Sequence With Bizarre Properties