Balancing cyclic \(R\)-ary Gray codes. II. (Q1010863)

From MaRDI portal
Revision as of 01:54, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Balancing cyclic \(R\)-ary Gray codes. II.
scientific article

    Statements

    Balancing cyclic \(R\)-ary Gray codes. II. (English)
    0 references
    7 April 2009
    0 references
    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).
    0 references
    cyclic \(n\)-digit Gray codes
    0 references
    digit changes
    0 references
    transition counts
    0 references
    balanced cyclic binary Gray codes
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references