The following pages link to Comma-Free Codes (Q3249331):
Displaying 50 items.
- Maximal dinucleotide and trinucleotide circular codes (Q304726) (← links)
- Dinucleotide circular codes (Q355961) (← links)
- Difference systems of sets based on cosets partitions (Q383644) (← links)
- A classification of 20-trinucleotide circular codes (Q418150) (← links)
- Sets of frequency hopping sequences under aperiodic Hamming correlation: upper bound and optimal constructions (Q476359) (← links)
- Diletter circular codes over finite alphabets (Q680445) (← links)
- Optimal difference systems of sets and difference sets (Q719663) (← links)
- Two-dimensional comma-free and cylindric codes (Q728259) (← links)
- Binary templates for comma-free DNA codes (Q876480) (← links)
- Circular codes, symmetries and transformations (Q888294) (← links)
- A genetic scale of reading frame coding (Q890678) (← links)
- Disjoint difference families and their applications (Q908044) (← links)
- Difference systems of sets and cyclotomy (Q924988) (← links)
- A 2006 review of circular codes in genes (Q929164) (← links)
- Varieties of comma-free codes (Q929165) (← links)
- A relation between trinucleotide comma-free codes and trinucleotide circular codes (Q935138) (← links)
- Perfect difference systems of sets and the unit group of \(Z_{p^n}\) (Q989270) (← links)
- Perfect difference systems of sets and Jacobi sums (Q1043561) (← links)
- A lower bound for 0,1,* tournament codes (Q1095111) (← links)
- Comma-free codes: An extension of certain enumerative techniques to recursively defined sequences (Q1153121) (← links)
- Retrograde codes and bounded synchronization delay (Q1184730) (← links)
- A combinatorial property of codes having finite synchronization delay (Q1247946) (← links)
- Generating functions of circular codes (Q1277204) (← links)
- Completing comma-free codes (Q1399997) (← links)
- A permuted set of a trinucleotide circular code coding the 20 amino acids in variant nuclear codes (Q1715152) (← links)
- Incomplete sums, DC-constrained codes, and codes that maintain synchronization (Q1802188) (← links)
- Strand design for biomolecular computation. (Q1853477) (← links)
- Improved singleton bound on frequency hopping sequences and optimal constructions (Q1999894) (← links)
- The alphabetic complexity in homomorphic definitions of word, tree and picture languages (Q2112173) (← links)
- Computational complexity of synchronization under sparse regular constraints (Q2140506) (← links)
- The relation between \(k\)-circularity and circularity of codes (Q2195624) (← links)
- Some results on \((k, m)\)-comma codes (Q2196433) (← links)
- Identification of all trinucleotide circular codes (Q2362450) (← links)
- Hall sets, Lazard sets and comma-free codes (Q2411623) (← links)
- Strong comma-free codes in genetic information (Q2412714) (← links)
- Circular codes revisited: a statistical approach (Q2413781) (← links)
- A recursive construction for difference systems of sets (Q2414933) (← links)
- An algorithm for optimal difference systems of sets (Q2471067) (← links)
- Combinatorial equivalence of (0,1) circulant matrices (Q2529626) (← links)
- Partitions of difference sets and code synchronization (Q2566179) (← links)
- Reducing the local alphabet size in tiling systems by means of 2D comma-free codes (Q2676458) (← links)
- <i>n</i> -Nucleotide circular codes in graph theory (Q2955842) (← links)
- A characterization of intercodes (Q3479536) (← links)
- The comma-free codes with words of length two (Q4087068) (← links)
- The syntactic monoid of the semigroup generated by a comma-free code (Q4698382) (← links)
- Combinatorial problems motivated by comma‐free codes (Q4736762) (← links)
- Finite Completion of comma-free codes Part 1 (Q4825390) (← links)
- Finite Completion of comma-free codes Part 2 (Q4825391) (← links)
- Non-overlapping matrices via Dyck words (Q5056204) (← links)
- Conjugacy classes and rational period functions for the Hecke groups (Q5881023) (← links)
