Hash Property and Fixed-rate Universal Coding Theorems

Details Hash Property and Fixed-rate Universal Coding Theorems Hash Property and Fixed-rate Universal Coding Theorems

2008-04-08

arxiv.org/abs/0804.1183v1

IEEE Transactions on Information Theory, vol.IT-56, no.6, pp.2688-2698, June 2010

Computer Science

Information Theory

submitted to IEEE Transactions on Information Theory, Mar. 2008. 15 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Hash Property and Fixed-rate Universal Coding Theorems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hash Property and Fixed-rate Universal Coding Theorems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hash Property and Fixed-rate Universal Coding Theorems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-539977