ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Distributed Function Computation over Fields and Rings via Linear Compression of Sources

Vinodh, K and Lalitha, V and Prakash1, N and Vijay Kumar1, P and Sandeep Pradhan, S (2011) Distributed Function Computation over Fields and Rings via Linear Compression of Sources. In: Journal of the Indian Institute of Science, 91 (1). pp. 181-205.

[img]
Preview
PDF
gG.pdf - Published Version

Download (624Kb)
Official URL: http://journal.library.iisc.ernet.in/archives.html

Abstract

The setting considered in this paper is one of distributed function computation. More specifically, there is a collection of N sources possessing correlated information and a destination that would like to acquire a specific linear combination of the N sources. We address both the case when the common alphabet of the sources is a finite field and the case when it is a finite, commutative principal ideal ring with identity. The goal is to minimize the total amount of information needed to be transmitted by the N sources while enabling reliable recovery at the destination of the linear combination sought. One means of achieving this goal is for each of the sources to compress all the information it possesses and transmit this to the receiver. The Slepian-Wolf theorem of information theory governs the minimum rate at which each source must transmit while enabling all data to be reliably recovered at the receiver. However, recovering all the data at the destination is often wasteful of resources since the destination is only interested in computing a specific linear combination. An alternative explored here is one in which each source is compressed using a common linear mapping and then transmitted to the destination which then proceeds to use linearity to directly recover the needed linear combination. The article is part review and presents in part, new results. The portion of the paper that deals with finite fields is previously known material, while that dealing with rings is mostly new.Attempting to find the best linear map that will enable function computation forces us to consider the linear compression of source. While in the finite field case, it is known that a source can be linearly compressed down to its entropy, it turns out that the same does not hold in the case of rings. An explanation for this curious interplay between algebra and information theory is also provided in this paper.

Item Type: Journal Article
Additional Information: Copyright of this article belongs to The Indian Institute of Science (IISc).
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 09 Feb 2012 10:04
Last Modified: 09 Feb 2012 10:04
URI: http://eprints.iisc.ernet.in/id/eprint/43263

Actions (login required)

View Item View Item