Distance-2 Cyclic Chaining of Constant-Weight Codes

DOI10.1109/T-C.1973.223681MaRDI QIDQ5661388zbMATH OpenWikidataFDO

Authors

Publication date 1973

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/T-C.1973.223681

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Software, source code, etc. for problems pertaining to information and communication theory (94-04) Other types of codes (94B60)

Recommendations

• scientific article; zbMATH DE number 3873230
• Constructions of binary constant-weight cyclic codes and cyclically permutable codes
• On combinatorial Gray codes with distance 3
• Construction of certain cyclic distance-preserving codes having linear-algebraic characteristics
• scientific article; zbMATH DE number 1353839

Cited in

(21)

• The coolest way to generate combinations
• Gray-Codes
• On m-ary Gray codes
• On level-weight studies of binary and m-ary Gray codes
• A technique for generating Gray codes
• The 0-1 integer programming problem in a finite ring with identity
• Trimming and gluing Gray codes
• Gray codes for reflection groups
• Short proof that Kneser graphs are Hamiltonian for n 4k
• Flip-swap languages in binary reflected Gray code order
• On the central levels problem
• scientific article; zbMATH DE number 3873230 (Why is no real title available?)
• On a combinatorial generation problem of Knuth
• A low spatial complexity algorithm to generate combinations with the strong minimal change property
• A minimum-change version of the Chung-Feller theorem for Dyck paths
• A minimum-change version of the Chung-Feller theorem for Dyck paths
• Star transposition Gray codes for multiset permutations
• Kneser graphs are Hamiltonian
• On the hardness of Gray code problems for combinatorial objects
• Kneser graphs are Hamiltonian (extended abstract)
• Kneser graphs are Hamiltonian

This page was built for publication: Distance-2 Cyclic Chaining of Constant-Weight Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5661388)