4 citations · 5 across the 6 of their papers we have counts for
6 papers
Source Coding for a Simple Network with Receiver Side Information
R. Timo, A. Grant, T. Chan +1
We consider the problem of source coding with receiver side information for the simple network proposed by R. Gray and A. Wyner in 1974. In this network, a transmitter must reliabl…
The minimal set of Ingleton inequalities
Laurent Guille, Terence Chan, Alex Grant
The Ingleton-LP bound is an outer bound for the multicast capacity region, assuming the use of linear network codes. Computation of the bound is performed on a polyhedral cone obta…
Mission impossible: Computing the network coding capacity region
Terence Chan, Alex Grant
One of the main theoretical motivations for the emerging area of network coding is the achievability of the max-flow/min-cut rate for single source multicast. This can exceed the r…
Dualities Between Entropy Functions and Network Codes
Terence Chan, Alex Grant
This paper provides a new duality between entropy functions and network codes. Given a function defined on all proper subsets of random variables, we provide a constr…
Entropy vectors and network codes
Terence Chan, Alex Grant
We consider a network multicast example that relates the solvability of the multicast problem with the existence of an entropy function. As a result, we provide an alternative appr…
On Random Network Coding for Multicast
Adria Tauste-Campo, Alex Grant
Random linear network coding is a particularly decentralized approach to the multicast problem. Use of random network codes introduces a non-zero probability however that some sink…