A simple proof for the existence of exponentially balanced Gray codes

zbMATH Open1079.94010MaRDI QIDQ2571312FDOQ2571312

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

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

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

zbMATH Keywords

Gray codesexponentially balanced Gray codestransition count spectrum

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (7)

• Balancing cyclic \(R\)-ary Gray codes. II.
• On the spectrum of Hamiltonian cycles in the \(n\)-cube
• Some classes of bipartite graphs induced by Gray codes
• Antipodal Gray codes
• Balancing cyclic \(R\)-ary Gray codes
• On locally balanced Gray codes
• Title not available (Why is that?)

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)