Achievable Rate Regions for Network Coding

DOI10.1109/TIT.2015.2403315MaRDI QIDQ2978621zbMATH OpenFDO

Authors Randall Dougherty, Chris Freiling, Kenneth Zeger

Publication date 28 April 2017

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

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

Mathematics Subject Classification ID

Information theory (general) (94A15) Source coding (94A29)

Abstract: Determining the achievable rate region for networks using routing, linear coding, or non-linear coding is thought to be a difficult task in general, and few are known. We describe the achievable rate regions for four interesting networks (completely for three and partially for the fourth). In addition to the known matrix-computation method for proving outer bounds for linear coding, we present a new method which yields actual characteristic-dependent linear rank inequalities from which the desired bounds follow immediately.

Cited in

(3)

• An Implicit Characterization of the Achievable Rate Region for Acyclic Multisource Multisink Network Coding
• A New Achievable Rate-Distortion Region for Distributed Source Coding
• Variable-Rate Linear Network Coding

This page was built for publication: Achievable Rate Regions for Network Coding

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