Balancing cyclic \(R\)-ary Gray codes (Q2372875)

From MaRDI portal
Revision as of 06: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
scientific article

    Statements

    Balancing cyclic \(R\)-ary Gray codes (English)
    0 references
    0 references
    0 references
    16 July 2007
    0 references
    Summary: New cyclic \(n\)-digit Gray codes are constructed over \(\{0, 1, \dots, R-1 \}\) for all \(R \geq 3\), \(n \geq 2\). These codes have the property that the distribution of the digit changes (transition counts) is close to uniform: For each~\(n \geq 2\), every transition count is within \(R-1\) of the average~\(R^n/n\), and for the \(2\)-digit codes every transition count is either \(\lfloor{R^2/2} \rfloor\) or \(\lceil{R^2/2} \rceil\).
    0 references

    Identifiers

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