Lossless and lossy source compression with near-uniform output: Is common randomness always required?

Document Type

Conference Proceeding

Publication Date

9-28-2015

Abstract

It is known that a sub-linear rate of source-independent random seed (common randomness) can enable the construction of lossless compression codes whose output is nearly uniform under the variational distance (Chou-Bloch-ISIT'13). This work uses finite-blocklength techniques to present an alternate proof that for near-uniform lossless compression, the seed length has to grow strictly larger than √n, where n represents the blocklength of the lossless compression code. In the lossy setting, we show the surprising result that a seed is not required to make the encoder output nearly uniform.

Identifier

84969834367 (Scopus)

ISBN

[9781467377041]

Publication Title

IEEE International Symposium on Information Theory Proceedings

External Full Text Location

https://doi.org/10.1109/ISIT.2015.7282840

ISSN

21578095

First Page

2171

Last Page

2175

Volume

2015-June

Grant

CCF-1320298

Fund Ref

National Sleep Foundation

This document is currently not available here.

Share

COinS