Treffer: Computing Linear Functions by Linear Coding Over Networks

Title:
Computing Linear Functions by Linear Coding Over Networks
Source:
IEEE transactions on information theory. 60(1):422-431
Publisher Information:
New York, NY: Institute of Electrical and Electronics Engineers, 2014.
Publication Year:
2014
Physical Description:
print, 21 ref
Original Material:
INIST-CNRS
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
IBM Research-Almaden, San Jose, CA 95120, United States
Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA 92093, United States
ISSN:
0018-9448
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Telecommunications and information theory
Accession Number:
edscal.28149734
Database:
PASCAL Archive

Weitere Informationen

We consider the scenario in which a set of sources gen erates messages in a network and a receiver node demands an arbitrary linear function of these messages. We formulate an algebraic test to determine whether an arbitrary network can compute linear functions using linear codes. We identify a class of linear functions that can be computed using linear codes in every network that satisfies a natural cut-based condition. Conversely, for another class of linear functions, we show that the cut-based condition does not guarantee the existence of a linear coding solution. For linear functions over the binary field, the two classes are complements of each other.