A technique for generating Gray codes

DOI10.1016/0378-3758(81)90027-6zbMath0459.94023OpenAlexW2049958805MaRDI QIDQ1152345

J. L. Sampson, Jacques E. Ludman

Publication date: 1981

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0378-3758(81)90027-6

Mathematics Subject Classification ID

Other types of codes (94B60)

Related Items (4)

Amortized efficiency of generating planar paths in convex position ⋮ Monotone Gray codes and the middle levels problem ⋮ Gray codes for reflection groups ⋮ On a characterization of the standard Gray code by using the edge type on a hypercube

Cites Work

• Designing Experiments When Run Order Is Important
• Some Run Orders Requiring a Minimum Number of Factor Level Changes for the 2 4 and 2 5 Main Effect Plans
• Distance-2 Cyclic Chaining of Constant-Weight Codes

This page was built for publication: A technique for generating Gray codes