Affine m-ary gray codes
From MaRDI portal
Publication:5601233
DOI10.1016/S0019-9958(63)90119-0zbMath0202.50303MaRDI QIDQ5601233
Publication date: 1963
Published in: Information and Control (Search for Journal in Brave)
Related Items (9)
Comparison of LZ77-type parsings ⋮ Unnamed Item ⋮ Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions ⋮ Observations on a class of nasty linear complementarity problems ⋮ On \(m\)-ary Gray codes ⋮ On level-weight studies of binary and m-ary Gray codes ⋮ Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity ⋮ Gray codes for reflection groups ⋮ Gray cycles of maximum length related to \(k\)-character substitutions
This page was built for publication: Affine m-ary gray codes
