Explicit definition of the binary reflected Gray codes

DOI10.1016/S0012-365X(98)00188-5MaRDI QIDQ1296989zbMATH OpenFDO

Authors Marston D. E. Conder

Publication date 6 April 2000

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

binomial coefficientbinary reflected Gray codeSierpinski's gasket

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Linear codes (general theory) (94B05)

Recommendations

• On binary reflected Gray codes and functions
• On Generating the N-ary Reflected Gray Codes
• Some remarks on the combinatories of Gray codes
• scientific article; zbMATH DE number 3681652
• scientific article; zbMATH DE number 2239558

Cites work

• scientific article; zbMATH DE number 108079 (Why is no real title available?)
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• Gray codes for reflection groups
• Vertex-transitive non-Cayley graphs with arbitrarily large vertex-stabilizer

Cited in

(4)

• On binary reflected Gray codes and functions
• Gray codes generation algorithm and theoretical evaluation of random walks in \(N\)-cubes
• A fractal set from the binary reflected Gray code
• Classical bounds on two-outcome bipartite Bell expressions and linear prepare-and-measure witnesses: Efficient computation in parallel environments such as graphics processing units

This page was built for publication: Explicit definition of the binary reflected Gray codes

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