|
Дискретный анализ и исследование операций, сер. 1, 2004, том 11, выпуск 4, страницы 81–98
(Mi da122)
|
|
|
|
Эта публикация цитируется в 5 научных статьях (всего в 5 статьях)
Totally balanced and exponentially balanced Gray codes
A. J. van Zanten, I. N. Suparta Delft University of Technology
Аннотация:
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.
Статья поступила: 30.06.2004
Образец цитирования:
A. J. van Zanten, I. N. Suparta, “Totally balanced and exponentially balanced Gray codes”, Дискретн. анализ и исслед. опер., сер. 1, 11:4 (2004), 81–98
Образцы ссылок на эту страницу:
https://www.mathnet.ru/rus/da122 https://www.mathnet.ru/rus/da/v11/s1/i4/p81
|
Статистика просмотров: |
Страница аннотации: | 725 | PDF полного текста: | 301 | Список литературы: | 59 |
|