Hash Property and Fixed-Rate Universal Coding Theorems

Hash Property and Fixed-Rate Universal Coding Theorems

The aim of this paper is to prove the fixed-rate universal coding theorems by using the notion of the hash property. These theorems are the fixed-rate lossless universal source coding theorem and the fixed-rate universal channel coding theorem. Since an ensemble of sparse matrices (with logarithmic...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory 2010-06, Vol.56 (6), p.2688-2698
Hauptverfasser: Muramatsu, Jun, Miyake, Shigeki
Format: Artikel
Sprache:eng
Schlagworte:
Approximation methods
Channel coding
Channels
Codes
Coding
Construction
Error probability
fixed-rate universal codes
Hash based algorithms
hash functions
Information theory
Laboratories
Linear code
linear codes
Lossless
lossless source coding
Maximum likelihood decoding
minimum-divergence encoding
minimum-entropy decoding
Probability distribution
Shannon theory
Source coding
Sparse matrices
sparse matrix
Theorems
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The aim of this paper is to prove the fixed-rate universal coding theorems by using the notion of the hash property. These theorems are the fixed-rate lossless universal source coding theorem and the fixed-rate universal channel coding theorem. Since an ensemble of sparse matrices (with logarithmic column degree) satisfies the hash property requirement, it is proved that we can construct universal codes by using sparse matrices.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2010.2046214