Distance-2 Cyclic Chaining of Constant-Weight Codes
From MaRDI portal
Publication:5661388
DOI10.1109/T-C.1973.223681zbMath0248.94007WikidataQ64148785 ScholiaQ64148785MaRDI QIDQ5661388
No author found.
Publication date: 1973
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Other types of codes (94B60) Software, source code, etc. for problems pertaining to information and communication theory (94-04)
Related Items (16)
On a Combinatorial Generation Problem of Knuth ⋮ Flip-swap languages in binary reflected Gray code order ⋮ Star transposition Gray codes for multiset permutations ⋮ On \(m\)-ary Gray codes ⋮ Trimming and gluing Gray codes ⋮ On level-weight studies of binary and m-ary Gray codes ⋮ A technique for generating Gray codes ⋮ On the central levels problem ⋮ The 0-1 integer programming problem in a finite ring with identity ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ Short proof that Kneser graphs are Hamiltonian for \(n \geqslant 4k\) ⋮ Gray codes for reflection groups ⋮ A low spatial complexity algorithm to generate combinations with the strong minimal change property ⋮ The coolest way to generate combinations ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ Gray-Codes
This page was built for publication: Distance-2 Cyclic Chaining of Constant-Weight Codes
