On Redundancy of Rice Coding
- Alexandre Krivoulets
Research Output:
Book / Anthology / Report
Report
Open access
Publication Information
Output type
Research Output:
Book / Anthology / Report
Report
Original language
EnglishPublication milestones
- Published - 09/2003
Publication status
Published - 09/2003
Place of publication
CopenhagenEdition
TR-2003-32Publisher
IT-Universitetet i København, DenmarkBook series
- Book series name: IT University Technical Report Series
Series number: TR-2003-32
ISSN: 1600-6100
ISBN (Electronic)
87-7949-043-3Abstract
In this paper we derive the relative per-symbol redundancy of the Rice coding algorithm, which is a widely used technique in image compression for very fast entropy coding. We show, that for some important source models, such as the two-sided geometric distribution (TSGD), the redundancy depends on the source entropy H and it tends to zero if H -> oo. The redundancy is upper bounded by 50% if H -> 0.
Access to documents
Final published version, 229.98 KB