Hash Property and Fixed-rate Universal Coding Theorems
Information Theory
2012-05-22 v1 math.IT
Abstract
The aim of this paper is to prove the achievability of fixed-rate universal coding problems by using our previously introduced notion of hash property. These problems are the fixed-rate lossless universal source coding problem and the fixed-rate universal channel coding problem. Since an ensemble of sparse matrices satisfies the hash property requirement, it is proved that we can construct universal codes by using sparse matrices.
Cite
@article{arxiv.0804.1183,
title = {Hash Property and Fixed-rate Universal Coding Theorems},
author = {Jun Muramatsu and Shigeki Miyake},
journal= {arXiv preprint arXiv:0804.1183},
year = {2012}
}
Comments
submitted to IEEE Transactions on Information Theory, Mar. 2008. 15 pages