Gray code compression
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F09%3A10022139" target="_blank" >RIV/00216208:11320/09:10022139 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Gray code compression
Original language description
An n-bit cyclic Gray code is a cyclic sequence of all n-bit strings such that consecutive strings differ in a single bit. We describe a construction of an n-bit cyclic Gray code whose graph of transitions is a subgraph of the d-dimensional hypercube and2^{d -1}{n{2^d. This allows to compress sequences that follow this code so that only Theta(log log n) bits per n-bit string are needed.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GP201%2F08%2FP298" target="_blank" >GP201/08/P298: Subgraphs of hypercubes and their applications</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Lecture Notes in Computer Science
ISSN
0302-9743
e-ISSN
—
Volume of the periodical
2009
Issue of the periodical within the volume
5874
Country of publishing house
DE - GERMANY
Number of pages
11
Pages from-to
—
UT code for WoS article
000280084100019
EID of the result in the Scopus database
—