Comma-Free Codes
From MaRDI portal
Publication:3249331
DOI10.4153/CJM-1958-023-9zbMath0081.14601OpenAlexW2323136735WikidataQ55951498 ScholiaQ55951498MaRDI QIDQ3249331
Basil Gordon, Solomon W. Golomb, Lloyd R. Welch
Publication date: 1958
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1958-023-9
Related Items
Conjugacy classes and rational period functions for the Hecke groups ⋮ Identification of all trinucleotide circular codes ⋮ Maximal dinucleotide and trinucleotide circular codes ⋮ Computational complexity of synchronization under sparse regular constraints ⋮ A lower bound for 0,1,* tournament codes ⋮ Non-overlapping matrices via Dyck words ⋮ Finite Completion of comma-free codes Part 1 ⋮ Finite Completion of comma-free codes Part 2 ⋮ Dinucleotide circular codes ⋮ A characterization of intercodes ⋮ Binary templates for comma-free DNA codes ⋮ Difference systems of sets based on cosets partitions ⋮ Hall sets, Lazard sets and comma-free codes ⋮ Strong comma-free codes in genetic information ⋮ Circular codes revisited: a statistical approach ⋮ A recursive construction for difference systems of sets ⋮ Circular codes, symmetries and transformations ⋮ A genetic scale of reading frame coding ⋮ Reducing the local alphabet size in tiling systems by means of 2D comma-free codes ⋮ n -Nucleotide circular codes in graph theory ⋮ Completing comma-free codes ⋮ The relation between \(k\)-circularity and circularity of codes ⋮ A classification of 20-trinucleotide circular codes ⋮ Some results on \((k, m)\)-comma codes ⋮ Computer-aided constructions of commafree codes ⋮ Comma-free codes: An extension of certain enumerative techniques to recursively defined sequences ⋮ Disjoint difference families and their applications ⋮ A permuted set of a trinucleotide circular code coding the 20 amino acids in variant nuclear codes ⋮ Unnamed Item ⋮ Difference systems of sets and cyclotomy ⋮ A 2006 review of circular codes in genes ⋮ Varieties of comma-free codes ⋮ Sets of frequency hopping sequences under aperiodic Hamming correlation: upper bound and optimal constructions ⋮ A relation between trinucleotide comma-free codes and trinucleotide circular codes ⋮ The comma-free codes with words of length two ⋮ Retrograde codes and bounded synchronization delay ⋮ Diletter circular codes over finite alphabets ⋮ An algorithm for optimal difference systems of sets ⋮ Improved singleton bound on frequency hopping sequences and optimal constructions ⋮ Optimal difference systems of sets and difference sets ⋮ Perfect difference systems of sets and the unit group of \(Z_{p^n}\) ⋮ Two-dimensional comma-free and cylindric codes ⋮ A combinatorial property of codes having finite synchronization delay ⋮ Characterizations of \(k\)-comma codes and \(k\)-comma intercodes ⋮ The syntactic monoid of the semigroup generated by a comma-free code ⋮ Incomplete sums, DC-constrained codes, and codes that maintain synchronization ⋮ Combinatorial equivalence of (0,1) circulant matrices ⋮ Generating functions of circular codes ⋮ Combinatorial problems motivated by comma‐free codes ⋮ Perfect difference systems of sets and Jacobi sums ⋮ Partitions of difference sets and code synchronization ⋮ Strand design for biomolecular computation. ⋮ The alphabetic complexity in homomorphic definitions of word, tree and picture languages
