CaltechAUTHORS
Published July 2016 | Version public
Book Section - Chapter Metadata-only

On tightness of an entropic region outer bound for network coding and the edge removal property

Creators

  • 1. ROR icon California Institute of Technology
  • 2. ROR icon University at Buffalo, State University of New York

Abstract

In this work, we study the Yeung network coding entropic function outer bound and prove an equivalence relationship between its tightness and the edge removal problem. In addition, we derive an implicit characterization of the 0-error capacity region using restricted sets of entropic vectors.

Additional Information

© 2016 IEEE. This work is supported in part by the National Science Foundation under Grant No. CCF-1321129.

Additional details

Identifiers

Eprint ID
69901
DOI
10.1109/ISIT.2016.7541603
Resolver ID
CaltechAUTHORS:20160824-105856700

Related works

Describes
10.1109/ISIT.2016.7541603 (DOI)

Funding

NSF
CCF-1321129

Dates

Created
2016-08-24
Created from EPrint's datestamp field
Updated
2021-11-11
Created from EPrint's last_modified field