Deakin University
Browse

File(s) not publicly available

Predictive coding of integers with real-valued predictions

conference contribution
posted on 2023-02-07, 02:05 authored by M Ali, Manzur MurshedManzur Murshed
In this paper, we have extended the Rice-Golomb code so that it can operate at fractional precision to efficiently exploit the real-valued predictions. Coding at infinitesimal precision allows the residuals to be modeled with the Laplace distribution. Unlike the Rice-Golomb code, which maps equally probable opposite-signed residuals to different integers, the proposed coding scheme is symmetric in the sense that, at infinitesimal precision, it assigns codewords of equal length to equally probable residual intervals. The symmetry of both the Laplace distribution and the coding scheme facilitates the analysis of the proposed coding scheme to determine the average code-length and the optimal value of the associated coding parameter. © 2013 IEEE.

History

Pagination

431-440

Location

UT

Start date

2013-03-20

End date

2013-03-22

ISSN

1068-0314

ISBN-13

9780769549651

Language

English

Editor/Contributor(s)

Storer JA

Title of proceedings

Data Compression Conference Proceedings

Event

Data Compression Conference (DCC)

Publisher

IEEE

Series

IEEE Data Compression Conference

Usage metrics

    Research Publications

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC