Allerton 2015 Paper Abstract


Paper ThA3.4

MolavianJazi, Ebrahim (The Pennsylvania State University), Yener, Aylin (The Pennsylvania State University)

Subset Source Coding

Scheduled for presentation during the Regular Session "Data Storage" (ThA3), Thursday, October 1, 2015, 09:30−09:50, Butternut

53rd Annual Allerton Conference on Communication, Control, and Computing, Sept 29-Oct 2, 2015, Allerton Park and Retreat Center, Monticello, IL, USA

This information is tentative and subject to change. Compiled on December 5, 2021

Keywords Data Storage, Information Theory


Emerging applications including semantic information processing impose priorities on the possible realizations of information sources, so that not all source sequences are important. This paper proposes an initial framework for optimal lossless compression of subsets of the output of a discrete memoryless source (DMS). It turns out that, the optimal source code may not index the conventional source-typical sequences, but rather index certain subset-typical sequences determined by the source statistics as well as the subset structure. Building upon an achievability and a strong converse, an analytic expression is given, based on the Shannon entropy, relative entropy, and subset entropy, which identifies such subset-typical sequences for a broad class of subsets of a DMS. Interestingly, one often achieves a gain in the fundamental limit, in that the optimal compression rate for the subset can be strictly smaller than the source entropy, although this is not always the case.



All Content © PaperCept, Inc..

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2021 PaperCept, Inc.
Page generated 2021-12-05  09:35:49 PST  Terms of use