Linear time construction of a compressed Gray code

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10100610" target="_blank" >RIV/00216208:11320/13:10100610 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1016/j.ejc.2012.07.015" target="_blank" >http://dx.doi.org/10.1016/j.ejc.2012.07.015</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.ejc.2012.07.015" target="_blank" >10.1016/j.ejc.2012.07.015</a>

Result language

angličtina

Original language name

Linear time construction of a compressed Gray code

Original language description

An n-bit (cyclic) Gray code is a (cyclic) ordering of all n-bit strings such that consecutive strings differ in exactly one bit. We construct an n-bit cyclic Gray code whose graph of transitions is isomorphic to an induced subgraph of the d-dimensional hypercube where d equals the ceiling of lg n. This allows to represent the code so that only ?(log log n) bits per n-bit string are needed. We provide an explicit description of an algorithm which generates the transition sequence of such a code in lineartime with respect to the output size.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2013

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

European Journal of Combinatorics

ISSN

0195-6698

e-ISSN

—

Volume of the periodical

34

Issue of the periodical within the volume

1

Country of publishing house

GB - UNITED KINGDOM

Number of pages

13

Pages from-to

69-81

UT code for WoS article

000310110100007

EID of the result in the Scopus database

—