Affine m-ary gray codes
From MaRDI portal
Publication:5601233
DOI10.1016/S0019-9958(63)90119-0zbMATH Open0202.50303MaRDI QIDQ5601233FDOQ5601233
Authors: Martin Cohn 
Publication date: 1963
Published in: Information and Control (Search for Journal in Brave)
Recommendations
Cited In (17)
- Space-optimal quasi-Gray codes with logarithmic read complexity
- Gray codes for reflection groups
- On Generating the N-ary Reflected Gray Codes
- Gray codes from antimatroids
- Comparison of LZ77-type parsings
- Canonical form of Gray codes in \(N\)-cubes
- A Technique for Generating Specialized Gray Codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions
- On level-weight studies of binary and m-ary Gray codes
- Relations between greedy and bit-optimal LZ77 encodings
- On \(m\)-ary Gray codes
- A technique for generating Gray codes
- Observations on a class of nasty linear complementarity problems
- Generalized Gray map and a class of \(p\)-ary nonlinear codes
- Gray cycles of maximum length related to \(k\)-character substitutions
This page was built for publication: Affine m-ary gray codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5601233)
