Comma-Free Codes
From MaRDI portal
Publication:3249331
DOI10.4153/CJM-1958-023-9zbMATH Open0081.14601OpenAlexW2323136735WikidataQ55951498 ScholiaQ55951498MaRDI QIDQ3249331FDOQ3249331
Basil Gordon, Lloyd R. Welch, S. W. Golomb
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
Cited In (55)
- Low-hit-zone frequency hopping sequence sets under aperiodic Hamming correlation
- Non-overlapping matrices via Dyck words
- Constructions of low-hit-zone frequency hopping sequence sets from cyclic codes
- Difference systems of sets and cyclotomy
- Incomplete sums, DC-constrained codes, and codes that maintain synchronization
- A lower bound for 0,1,* tournament codes
- Combinatorial equivalence of (0,1) circulant matrices
- Title not available (Why is that?)
- The alphabetic complexity in homomorphic definitions of word, tree and picture languages
- A recursive construction for difference systems of sets
- Improved singleton bound on frequency hopping sequences and optimal constructions
- Retrograde codes and bounded synchronization delay
- Finite Completion of comma-free codes Part 1
- Finite Completion of comma-free codes Part 2
- Disjoint difference families and their applications
- Strong comma-free codes in genetic information
- Strand design for biomolecular computation.
- The comma-free codes with words of length two
- An algorithm for optimal difference systems of sets
- Maximal dinucleotide and trinucleotide circular codes
- Hall sets, Lazard sets and comma-free codes
- Perfect difference systems of sets and Jacobi sums
- Partitions of difference sets and code synchronization
- Dinucleotide circular codes
- Computational complexity of synchronization under sparse regular constraints
- A classification of 20-trinucleotide circular codes
- Circular codes, symmetries and transformations
- Binary templates for comma-free DNA codes
- Computer-aided constructions of commafree codes
- Comma-free codes: An extension of certain enumerative techniques to recursively defined sequences
- A 2006 review of circular codes in genes
- n -Nucleotide circular codes in graph theory
- A genetic scale of reading frame coding
- Varieties of comma-free codes
- A relation between trinucleotide comma-free codes and trinucleotide circular codes
- Characterizations of \(k\)-comma codes and \(k\)-comma intercodes
- Generating functions of circular codes
- Sets of frequency hopping sequences under aperiodic Hamming correlation: upper bound and optimal constructions
- Completing comma-free codes
- A characterization of intercodes
- Reducing the local alphabet size in tiling systems by means of 2D comma-free codes
- A permuted set of a trinucleotide circular code coding the 20 amino acids in variant nuclear codes
- The relation between \(k\)-circularity and circularity of codes
- Perfect difference systems of sets and the unit group of \(Z_{p^n}\)
- The syntactic monoid of the semigroup generated by a comma-free code
- A combinatorial property of codes having finite synchronization delay
- Combinatorial problems motivated by comma‐free codes
- Two-dimensional comma-free and cylindric codes
- Identification of all trinucleotide circular codes
- Circular codes revisited: a statistical approach
- Some results on \((k, m)\)-comma codes
- Difference systems of sets based on cosets partitions
- Conjugacy classes and rational period functions for the Hecke groups
- Optimal difference systems of sets and difference sets
- Diletter circular codes over finite alphabets
This page was built for publication: Comma-Free Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3249331)
