Comma-Free Codes
From MaRDI portal
Cited in
(56)- Perfect difference systems of sets and Jacobi sums
- A lower bound for 0,1,* tournament codes
- Comma-free codes: An extension of certain enumerative techniques to recursively defined sequences
- Retrograde codes and bounded synchronization delay
- A combinatorial property of codes having finite synchronization delay
- Generating functions of circular codes
- Completing comma-free codes
- A permuted set of a trinucleotide circular code coding the 20 amino acids in variant nuclear codes
- Incomplete sums, DC-constrained codes, and codes that maintain synchronization
- Strand design for biomolecular computation.
- Improved Singleton bound on frequency hopping sequences and optimal constructions
- The alphabetic complexity in homomorphic definitions of word, tree and picture languages
- Computational complexity of synchronization under sparse regular constraints
- The relation between \(k\)-circularity and circularity of codes
- Some results on \((k, m)\)-comma codes
- Identification of all trinucleotide circular codes
- 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
- An algorithm for optimal difference systems of sets
- Combinatorial equivalence of (0,1) circulant matrices
- Partitions of difference sets and code synchronization
- Reducing the local alphabet size in tiling systems by means of 2D comma-free codes
- \(n\)-nucleotide circular codes in graph theory
- Maximal dinucleotide and trinucleotide circular codes
- A characterization of intercodes
- Dinucleotide circular codes
- Difference systems of sets based on cosets partitions
- The comma-free codes with words of length two
- A classification of 20-trinucleotide circular codes
- The syntactic monoid of the semigroup generated by a comma-free code
- Combinatorial problems motivated by comma‐free codes
- Sets of frequency hopping sequences under aperiodic Hamming correlation: upper bound and optimal constructions
- Finite Completion of comma-free codes Part 1
- Finite Completion of comma-free codes Part 2
- Non-overlapping matrices via Dyck words
- Conjugacy classes and rational period functions for the Hecke groups
- Characterizations of k-comma codes and k-comma intercodes
- scientific article; zbMATH DE number 7731171 (Why is no real title available?)
- Computer-aided constructions of commafree codes
- Low-hit-zone frequency hopping sequence sets under aperiodic Hamming correlation
- Constructions of low-hit-zone frequency hopping sequence sets from cyclic codes
- Diletter circular codes over finite alphabets
- Homomorphic definitions of tree languages via comma-free tree codes
- Optimal difference systems of sets and difference sets
- Two-dimensional comma-free and cylindric codes
- Binary templates for comma-free DNA codes
- Circular codes, symmetries and transformations
- A genetic scale of reading frame coding
- Disjoint difference families and their applications
- Difference systems of sets and cyclotomy
- A 2006 review of circular codes in genes
- Varieties of comma-free codes
- A relation between trinucleotide comma-free codes and trinucleotide circular codes
- Perfect difference systems of sets and the unit group of \(Z_{p^n}\)
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)
