loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Data Compression Conference (dcc 2008)
March 25-March 27
ISBN: 978-0-7695-3121-2
ASCII Text
x 
 
Yuriy A. Reznik, "On Precision-Redundancy Relation in the Design of Source Coding Algorithms," Data Compression Conference, pp. 539, Data Compression Conference (dcc 2008), 2008.
 
 
BibTex
x
 
@article{ 10.1109/DCC.2008.103,
author = {Yuriy A. Reznik},
title = {On Precision-Redundancy Relation in the Design of Source Coding Algorithms},
journal ={Data Compression Conference},
volume = {0},
year = {2008},
issn = {1068-0314},
pages = {539},
doi = {http://doi.ieeecomputersociety.org/10.1109/DCC.2008.103},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Data Compression Conference
TI - On Precision-Redundancy Relation in the Design of Source Coding Algorithms
SN - 1068-0314
SP
EP
A1 - Yuriy A. Reznik,
PY - 2008
KW - source coding
KW - entropy
KW - information divergence
KW - approximations
KW - Diophantine approximations
VL - 0
JA - Data Compression Conference
ER -
 
We study the effects of finite-precision representation of source's probabilities on the efficiency of classic source coding algorithms, such as Shannon, Gilbert-Moore, or arithmetic codes. We derive several bounds for redundancy of such codes, and show how the problem of efficient constuction of such codes is related to one of finding simultaneous Diophantine approximations.
Index Terms:
source coding, entropy, information divergence, approximations, Diophantine approximations
Citation:
Yuriy A. Reznik, "On Precision-Redundancy Relation in the Design of Source Coding Algorithms," dcc, pp.539, Data Compression Conference (dcc 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.