loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2007 Data Compression Conference (DCC'07)
Snowbird, Utah
March 27-March 29
ISBN: 0-7695-2791-4
ASCII Text
x 
 
Shmuel T. Klein, "Fast Decoding of Fibonacci Encoded Texts," Data Compression Conference, pp. 388, 2007 Data Compression Conference (DCC'07), 2007.
 
 
BibTex
x
 
@article{ 10.1109/DCC.2007.38,
author = {Shmuel T. Klein},
title = {Fast Decoding of Fibonacci Encoded Texts},
journal ={Data Compression Conference},
volume = {0},
year = {2007},
issn = {1068-0314},
pages = {388},
doi = {http://doi.ieeecomputersociety.org/10.1109/DCC.2007.38},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Data Compression Conference
TI - Fast Decoding of Fibonacci Encoded Texts
SN - 1068-0314
SP
EP
A1 - Shmuel T. Klein,
PY - 2007
KW - null
VL - 0
JA - Data Compression Conference
ER -
 
Shmuel T. Klein, Bar Ilan University, Ramat-Gan 52900, Israel
The Fibonacci code of order m . 2, denoted by Fibm, is defined as the (infinite) set of binary strings w, each of which is terminated by m 1s, and such that a substring of m consecutive 1s does not appear anywhere in w except at its right end.
Citation:
Shmuel T. Klein, "Fast Decoding of Fibonacci Encoded Texts," dcc, pp.388, 2007 Data Compression Conference (DCC'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.