Index system and separability of constant weight Gray codes

DOI10.1109/18.86981MaRDI QIDQ3360805zbMATH OpenOpenAlexFDO

Authors A. J. van Zanten

Publication date 1991

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL http://resolver.tudelft.nl/uuid:fddff287-41dd-44d7-96fe-7055b0791ccc

zbMATH Keywords

constant weight codesGray codeindex systemlower and upper boundsnumber systemranking problemseparability

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Recommendations

• The separability of standard cyclic N-ary Gray codes
• scientific article; zbMATH DE number 4139306
• \(q\)-ary Gray codes and weight distributions
• The separability of Gray code (Corresp.)
• On m-ary Gray codes
• Gray Codes and Enumerative Coding for Vector Spaces
• On the separation of linear constant-weight codes
• scientific article; zbMATH DE number 3681652
• Gray codes with bounded weights
• Combinatorial Gray codes -- an updated survey

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
• Permutational labelling of constant weight Gray codes
• Symbolic Gray Code As A Data Allocation Scheme For Two-disc Systems
• The separability of Gray code (Corresp.)
• An upper bound associated with errors in Gray code (Corresp.)
• Efficient computation of statistical procedures based on all subsets of a specified size

This page was built for publication: Index system and separability of constant weight Gray codes

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