Linear Codes, Target Function Classes, and Network Computing Capacity
classification
💻 cs.IT
cs.DCmath.COmath.IT
keywords
classeslineartargetcodescomputingnetworkcapacitycoding
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.