This HTML5 document contains 46 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n7http://localhost/temp/predkladatel/
n18http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n16http://linked.opendata.cz/resource/domain/vavai/projekt/
n17http://linked.opendata.cz/ontology/domain/vavai/
n19http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n5http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F09%3A10022139%21RIV11-GA0-11320___/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n15http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F09%3A10022139%21RIV11-GA0-11320___
rdf:type
skos:Concept n17:Vysledek
dcterms: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 and 2^{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. 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 and 2^{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.
dcterms:title
Gray code compression Gray code compression
skos:prefLabel
Gray code compression Gray code compression
skos:notation
RIV/00216208:11320/09:10022139!RIV11-GA0-11320___
n3:aktivita
n12:S n12:P n12:Z
n3:aktivity
P(GP201/08/P298), S, Z(MSM0021620838)
n3:cisloPeriodika
5874
n3:dodaniDat
n15:2011
n3:domaciTvurceVysledku
n18:6249221 n18:8584079
n3:druhVysledku
n10:J
n3:duvernostUdaju
n14:S
n3:entitaPredkladatele
n5:predkladatel
n3:idSjednocenehoVysledku
316679
n3:idVysledku
RIV/00216208:11320/09:10022139
n3:jazykVysledku
n8:eng
n3:klicovaSlova
hypercube; graph of transitions; compression; Gray code
n3:klicoveSlovo
n4:hypercube n4:Gray%20code n4:compression n4:graph%20of%20transitions
n3:kodStatuVydavatele
DE - Spolková republika Německo
n3:kontrolniKodProRIV
[8A6F2334676E]
n3:nazevZdroje
Lecture Notes in Computer Science
n3:obor
n13:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
4
n3:projekt
n16:GP201%2F08%2FP298
n3:rokUplatneniVysledku
n15:2009
n3:svazekPeriodika
2009
n3:tvurceVysledku
Škrekovski, Riste Dimitrov, Darko Dvořák, Tomáš Gregor, Petr
n3:wos
000280084100019
n3:zamer
n19:MSM0021620838
s:issn
0302-9743
s:numberOfPages
11
n7:organizacniJednotka
11320