Linear Codes, Target Function Classes, and Network Computing Capacity
Information Theory
2011-05-10 v3 Distributed, Parallel, and Cluster Computing
Combinatorics
math.IT
Abstract
We study the use of linear codes for network computing in single-receiver networks with various classes of target functions of the source messages. Such classes include reducible, injective, semi-injective, and linear target functions over finite fields. Computing capacity bounds and achievability are given with respect to these target function classes for network codes that use routing, linear coding, or nonlinear coding.
Keywords
Cite
@article{arxiv.1101.0085,
title = {Linear Codes, Target Function Classes, and Network Computing Capacity},
author = {Rathinakumar Appuswamy and Massimo Franceschetti and Nikhil Karamchandani and Kenneth Zeger},
journal= {arXiv preprint arXiv:1101.0085},
year = {2011}
}