Linear Codes, Target Function Classes, and Network Computing Capacity

DOI10.1109/TIT.2013.2252052MaRDI QIDQ5346387zbMATH OpenOpenAlexFDO

Authors Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, Kenneth Zeger

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1101.0085

Mathematics Subject Classification ID

Information theory (general) (94A15) Source coding (94A29) Linear codes (general theory) (94B05) Network design and communication in computer systems (68M10)

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.

Recommendations

• Computing Linear Functions by Linear Coding Over Networks
• Linear codes for sources and source networks: Error exponents, universal coding
• scientific article; zbMATH DE number 2135149
• On Randomized Linear Network Codes and Their Error Correction Capabilities
• Polynomial-Time Construction of Linear Network Coding
• Linear network coding
• Linear network codes based on \(R\)-modules
• scientific article; zbMATH DE number 4062996
• On Base Field of Linear Network Coding
• A Unified Framework for Linear Network Coding

Cited in

(2)

• scientific article; zbMATH DE number 2135149 (Why is no real title available?)
• On the Optimal Achievable Rates for Linear Computation With Random Homologous Codes

This page was built for publication: Linear Codes, Target Function Classes, and Network Computing Capacity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346387)