On Generating the N-ary Reflected Gray Codes

DOI10.1109/TC.1984.5009360zbMath0542.94016MaRDI QIDQ3331130

M. C. Er

Publication date: 1984

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

zbMATH Keywords

program transformationrecursive algorithmscyclic Gray codeN-ary reflected Gray

Mathematics Subject Classification ID

Other types of codes (94B60) Cyclic codes (94B15)

Related Items (13)

A loopless algorithm for generating the permutations of a multiset ⋮ A trace partitioned Gray code forq-ary generalized Fibonacci strings ⋮ Gray codes and overlap cycles for restricted weight words ⋮ Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions ⋮ Restricted compositions and permutations: from old to new Gray codes ⋮ A 2D non-overlapping code over a \(q\)-ary alphabet ⋮ Prefix partitioned Gray codes for particular cross-bifix-free sets ⋮ Improved approximation algorithm for convex recoloring of trees ⋮ Cross-bifix-free sets in two dimensions ⋮ Gray code orders for \(q\)-ary words avoiding a given factor ⋮ Gray codes for reflection groups ⋮ \(q\)-ary Gray codes and weight distributions ⋮ Gray cycles of maximum length related to \(k\)-character substitutions

Uses Software

• SEC-DED

This page was built for publication: On Generating the N-ary Reflected Gray Codes