Affine m-ary gray codes
From MaRDI portal
Publication:5601233
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
- scientific article; zbMATH DE number 3681652 (Why is no real title available?)
- scientific article; zbMATH DE number 3409221 (Why is no real title available?)
- 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)