Permutational labelling of constant weight Gray codes

DOI10.1017/S000497270002044XMaRDI QIDQ3149456zbMATH OpenFDO

Authors Steve Seif, Inessa Levi

Publication date 10 February 2003

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S000497270002044X

zbMATH Keywords

constant weight Gray codeHamiltonian cyclesorthogonal labelling

Mathematics Subject Classification ID

Partitions of sets (05A18) Paths and cycles (05C38) Combinatorial codes (94B25)

Recommendations

• ALGORITHMS FOR LABELING CONSTANT WEIGHT GRAY CODES
• Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups
• Gray code sequences of partitions
• scientific article; zbMATH DE number 2192090
• A Gray code for set partitions

Cites work

• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• Idempotent rank in finite full transformation semigroups
• Index system and separability of constant weight Gray codes
• Monotone Gray codes and the middle levels problem

Cited in

(7)

• Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups
• Counting techniques to label constant weight Gray codes with links to minimal generating sets of semigroups
• Gray code for Cayley permutations
• Constant 2-labellings and an application to \((r, a, b)\)-covering codes
• A Gray code for permutations of size 2d with d descents
• scientific article; zbMATH DE number 2192090 (Why is no real title available?)
• ALGORITHMS FOR LABELING CONSTANT WEIGHT GRAY CODES

This page was built for publication: Permutational labelling of constant weight Gray codes

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