Binary Gray codes with long bit runs
From MaRDI portal
Publication:1408531
zbMath1023.05080MaRDI QIDQ1408531
Pavol Gvozdjak, Luis A. Goddyn
Publication date: 24 September 2003
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/122966
Related Items
Unnamed Item, 2-Factors Without Close Edges in the n-Dimensional Cube, On distance Gray codes, On flips in planar matchings, Description of polygonal regions by polynomials of bounded degree, A construction of Gray codes inducing complete graphs, On the spectrum of Hamiltonian cycles in the \(n\)-cube, Gray codes and symmetric chains, The maximum length of circuit codes with long bit runs and a new characterization theorem, On locally balanced gray codes