DocumentCode
1495240
Title
Hash Property and Fixed-Rate Universal Coding Theorems
Author
Muramatsu, Jun ; Miyake, Shigeki
Author_Institution
NTT Commun. Sci. Labs., NTT Corp., Kyoto, Japan
Volume
56
Issue
6
fYear
2010
fDate
6/1/2010 12:00:00 AM
Firstpage
2688
Lastpage
2698
Abstract
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.
Keywords
channel coding; source coding; sparse matrices; channel coding; fixed-rate universal coding theorems; hash property; logarithmic column degree; sparse matrices; universal source coding; Approximation methods; Channel coding; Error probability; Helium; Laboratories; Linear code; Maximum likelihood decoding; Probability distribution; Source coding; Sparse matrices; Channel coding; Shannon theory; fixed-rate universal codes; hash functions; linear codes; lossless source coding; minimum-divergence encoding; minimum-entropy decoding; sparse matrix;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2010.2046214
Filename
5466531
Link To Document