RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretn. Anal. Issled. Oper., Ser. 1, 2004, Volume 11, Number 4, Pages 81–98 (Mi da122)  

This article is cited in 4 scientific papers (total in 4 papers)

Totally balanced and exponentially balanced Gray codes

A. J. van Zanten, I. N. Suparta

Delft University of Technology

Abstract: The method of Robinson and Cohn to construct balanced and totally balanced Gray codes is discussed, as well as the extended version of this method by Bhat and Savage. We introduce a slight generalization of their construction which enables us to prove a long standing conjecture of Wagner and West about the existence of Gray codes having a specific spectrum of transition counts, i.e., all transition counts are powers of 2 and the exponents of these powers differ at most 1. Such a Gray code can be considered as generalization of a totally balanced Gray code when the length of the codewords is not a 2-power.

Full text: PDF file (298 kB)
References: PDF file   HTML file

Bibliographic databases:
UDC: 519.72
Received: 30.06.2004
Language:

Citation: A. J. van Zanten, I. N. Suparta, “Totally balanced and exponentially balanced Gray codes”, Diskretn. Anal. Issled. Oper., Ser. 1, 11:4 (2004), 81–98

Citation in format AMSBIB
\Bibitem{VanSup04}
\by A.~J.~van Zanten, I.~N.~Suparta
\paper Totally balanced and exponentially balanced Gray codes
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 2004
\vol 11
\issue 4
\pages 81--98
\mathnet{http://mi.mathnet.ru/da122}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2113073}
\zmath{https://zbmath.org/?q=an:1078.94040}


Linking options:
  • http://mi.mathnet.ru/eng/da122
  • http://mi.mathnet.ru/eng/da/v11/s1/i4/p81

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Suparta I.N., “A simple proof for the existence of exponentially balanced Gray codes”, Electron J Combin, 12:1 (2005), N19  mathscinet  zmath  isi
    2. Flahive M., Bose B., “Balancing cyclic R-ary Gray codes”, Electron J Combin, 14:1 (2007), R31  mathscinet  zmath  isi
    3. Flahive M., “Balancing cycli R-ary Gray codes II”, Electron J Combin, 15:1 (2008), R128  mathscinet  zmath  isi
    4. Contassot-Vivier S. Couchot J.-F. Heam P.-C., “Gray Codes Generation Algorithm and Theoretical Evaluation of Random Walks in N-Cubes”, 6, no. 6, 2018, 98  crossref  isi  scopus
  • Дискретный анализ и исследование операций
    Number of views:
    This page:561
    Full text:205
    References:42

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020