Worst-Case Asymmetric Distributed Source Coding

Agnihotri, Samar and Jamadagni, HS (2008) Worst-Case Asymmetric Distributed Source Coding. In: 46th Annual Allerton Conference on Communication, Control and Computing, SEP, 2008, Monticello, IL, pp. 653-660.

PDF getPDF.pdf - Published Version Restricted to Registered users only Download (186kB) | Request a copy

Abstract

We consider the asymmetric distributed source coding problem, where the recipient interactively communicates with N correlated informants to gather their data. We are mainly interested in minimizing the worst-case number of informant bits required for successful data-gathering at recipient, but we are also concerned with minimizing the number of rounds as well as the number of recipient bits. We provide two algorithms, one that optimally minimizes the number of informant bits and other that trades-off the number of informant bits to efficiently reduce the number of rounds and number of recipient bits.

Item Type:	Conference Paper
Publication:	Annual allerton conference on communication, control, and computing
Publisher:	IEEE
Additional Information:	Copyright 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre:	Division of Electrical Sciences > Electronic Systems Engineering (Formerly Centre for Electronic Design & Technology)
Date Deposited:	22 Dec 2009 07:04
Last Modified:	19 Sep 2010 05:41
URI:	http://eprints.iisc.ac.in/id/eprint/22288

Actions (login required)

View Item