Binary Gray codes with long bit runs.
The Electronic Journal of Combinatorics [electronic only] (2003)
- Volume: 10, Issue: 1, page Research paper R27, 10 p.-Research paper R27, 10 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topGoddyn, Luis, and Gvozdjak, Pavol. "Binary Gray codes with long bit runs.." The Electronic Journal of Combinatorics [electronic only] 10.1 (2003): Research paper R27, 10 p.-Research paper R27, 10 p.. <http://eudml.org/doc/122966>.
@article{Goddyn2003,
author = {Goddyn, Luis, Gvozdjak, Pavol},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {Hamilton cycle; Hamilton circle; spread; gap; threshold; Hamming distance},
language = {eng},
number = {1},
pages = {Research paper R27, 10 p.-Research paper R27, 10 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Binary Gray codes with long bit runs.},
url = {http://eudml.org/doc/122966},
volume = {10},
year = {2003},
}
TY - JOUR
AU - Goddyn, Luis
AU - Gvozdjak, Pavol
TI - Binary Gray codes with long bit runs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2003
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 10
IS - 1
SP - Research paper R27, 10 p.
EP - Research paper R27, 10 p.
LA - eng
KW - Hamilton cycle; Hamilton circle; spread; gap; threshold; Hamming distance
UR - http://eudml.org/doc/122966
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.