Pages that link to "Item:Q5661388"
From MaRDI portal
The following pages link to Distance-2 Cyclic Chaining of Constant-Weight Codes (Q5661388):
Displayed 16 items.
- The coolest way to generate combinations (Q1044892) (← links)
- Gray-Codes (Q1055391) (← links)
- On \(m\)-ary Gray codes (Q1141125) (← links)
- On level-weight studies of binary and m-ary Gray codes (Q1148862) (← links)
- A technique for generating Gray codes (Q1152345) (← links)
- The 0-1 integer programming problem in a finite ring with identity (Q1155522) (← links)
- Trimming and gluing Gray codes (Q1694730) (← links)
- Gray codes for reflection groups (Q1825283) (← links)
- Short proof that Kneser graphs are Hamiltonian for \(n \geqslant 4k\) (Q2032752) (← links)
- Flip-swap languages in binary reflected Gray code order (Q2676472) (← links)
- On the central levels problem (Q2692785) (← links)
- On a Combinatorial Generation Problem of Knuth (Q5080484) (← links)
- A low spatial complexity algorithm to generate combinations with the strong minimal change property (Q5242834) (← links)
- A minimum-change version of the Chung-Feller theorem for Dyck paths (Q5915781) (← links)
- A minimum-change version of the Chung-Feller theorem for Dyck paths (Q5970257) (← links)
- Star transposition Gray codes for multiset permutations (Q6074576) (← links)