Hash Property and Fixed-Rate Universal Coding Theorems

DOI10.1109/TIT.2010.2046214MaRDI QIDQ5281446zbMATH OpenFDO

Authors Jun Muramatsu, Shigeki Miyake

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0804.1183

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

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.

Cited in

(4)

• Source Coding Using Families of Universal Hash Functions
• scientific article; zbMATH DE number 6123029 (Why is no real title available?)
• Corrections to “Hash Property and Fixed-Rate Universal Coding Theorems” [Jun 10 2688-2698]
• Hash property and coding theorems for sparse matrices and maximum-likelihood coding

This page was built for publication: Hash Property and Fixed-Rate Universal Coding Theorems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281446)