Balancing cyclic R-ary Gray codes. II.
Summary: New cyclic \(n\)-digit Gray codes are constructed over \(\{0, 1, \dots, R-1 \}\) for all \(R \geq 2\), \(n \geq 3\). These codes have the property that the distribution of digit changes (transition counts) between two successive elements is close to uniform. For \(R=2\), the construction and proof are simpler than earlier balanced cyclic binary Gray codes. For \(R \geq 3\) and \(n \geq 2\), every transition count is within 2 of the average \(R^n/n\). For even \(R >2\), the codes are as close to uniform as possible, except when there are two anomalous transition counts for \(R \equiv 2 \pmod{4}\) and \(R^n\) is divisible by \(n\). For Part I see ibid. 14. No. 1, Research paper R31, 14 p. (2007; Zbl 1165.94005).
- Balancing cyclic \(R\)-ary Gray codes
- scientific article; zbMATH DE number 2239558
- On locally balanced Gray codes
- On m-ary Gray codes
- On the cyclicity of the Gray image of a class of linear cyclic codes over a finite chain ring
- The separability of standard cyclic N-ary Gray codes
- A simple proof for the existence of exponentially balanced Gray codes
- Balanced Gray codes
- scientific article; zbMATH DE number 2124961
- The gray image of the cyclic codes over \(\mathbb F_2[u]/\langle u^2-1\rangle\)
- Balanced Gray codes
- Cyclic arrangements with minimum modulo \(m\) winding numbers
- Balancing cyclic \(R\)-ary Gray codes
- A simple proof for the existence of exponentially balanced Gray codes
- Space-optimal quasi-Gray codes with logarithmic read complexity
- Reordering columns for smaller indexes
- Theory and design ofm-ary balanced codes which are invariant under symbol permutation
- scientific article; zbMATH DE number 2239558 (Why is no real title available?)
This page was built for publication: Balancing cyclic \(R\)-ary Gray codes. II.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010863)
