4 citations · 4 across the 3 of their papers we have counts for
3 papers
cs.IT2008★ 4 cited
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…
cs.IT2008
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…
cs.IT2008
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…