A simple proof for the existence of exponentially balanced Gray codes

MaRDI QIDQ2571312zbMATH OpenFDO

Authors I. Nengah Suparta

Publication date 1 November 2005

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/125509, http://www.emis.de/journals/EJC/Volume_12/Abstracts/v12i1n19.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

exponentially balanced Gray codesGray codestransition count spectrum

Mathematics Subject Classification ID

Source coding (94A29)

Review text

Summary: A Gray code of length \(n\) is a circular list of all \(2^n\) bitstrings or binary codewords of length \(n\) such that successive codewords differ in only one bit position. The frequencies of the positions where these differences occur are called transition counts. An exponentially balanced Gray codes is derived. The proof is much simpler than an earlier proof presented by \textit{A. J. van Zantan} and \textit{I. N. Suparta} [Disretn. Anal. Issled. Oper., Ser. 1, 11, No. 4, 81--98 (2004; Zbl 1078.94040)].

Recommendations

• scientific article; zbMATH DE number 2239558
• Balanced Gray codes
• Generalized Gray codes with prescribed ends
• Balancing cyclic \(R\)-ary Gray codes. II.
• On locally balanced Gray codes

Cited in

(8)

• Balancing cyclic \(R\)-ary Gray codes. II.
• Balanced Gray codes
• Antipodal Gray codes
• On the spectrum of Hamiltonian cycles in the \(n\)-cube
• Balancing cyclic \(R\)-ary Gray codes
• On locally balanced Gray codes
• Some classes of bipartite graphs induced by Gray codes
• scientific article; zbMATH DE number 2239558 (Why is no real title available?)

This page was built for publication: A simple proof for the existence of exponentially balanced Gray codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2571312)