12 citations · 36 across the 13 of their papers we have counts for
13 papers
A Quasi-Uniform Approach to Characterizing the Boundary of the Almost Entropic Region
Satyajit Thakor, Dauood Saleem
The convex closure of entropy vectors for quasi-uniform random vectors is the same as the closure of the entropy region. Thus, quasi-uniform random vectors constitute an important…
On the Partition Bound for Undirected Unicast Network Information Capacity
Mohammad Ishtiyaq Qureshi, Satyajit Thakor
One of the important unsolved problems in information theory is the conjecture that network coding has no rate benefit over routing in undirected unicast networks. Three known boun…
Undirected Unicast Network Capacity: A Partition Bound
Satyajit Thakor, Mohammad Ishtiyaq Qureshi
In this paper, we present a new technique to obtain upper bounds on undirected unicast network information capacity. Using this technique, we characterize an upper bound, called pa…
On Characterization of Entropic Vectors at the Boundary of Almost Entropic Cones
Hitika Tiwari, Satyajit Thakor
The entropy region is a fundamental object in information theory. An outer bound for the entropy region is defined by a minimal set of Shannon-type inequalities called elemental in…
On Enumerating Distributions for Associated Vectors in the Entropy Space
Sultan Alam, Satyajit Thakor, Syed Abbas
This paper focuses on the problem of finding a distribution for an associated entropic vector in the entropy space nearest to a given, possibly non-entropic, target vector for rand…
A Minimal Set of Shannon-type Inequalities for Functional Dependence Structures
Satyajit Thakor, Terence Chan, Alex Grant
The minimal set of Shannon-type inequalities (referred to as elemental inequalities), plays a central role in determining whether a given inequality is Shannon-type. Often, there a…
Capacity Bounds for Networks with Correlated Sources and Characterisation of Distributions by Entropies
Satyajit Thakor, Terence Chan, Alex Grant
Characterising the capacity region for a network can be extremely difficult. Even with independent sources, determining the capacity region can be as hard as the open problem of ch…
Characterising Probability Distributions via Entropies
Satyajit Thakor, Terence Chan, Alex Grant
Characterising the capacity region for a network can be extremely difficult, especially when the sources are dependent. Most existing computable outer bounds are relaxations of the…
Upper Bounds on the Capacity of 2-Layer -Relay Symmetric Gaussian Network
Satyajit Thakor, Syed Abbas
The Gaussian parallel relay network, in which two parallel relays assist a source to convey information to a destination, was introduced by Schein and Gallager. An upper bound on t…
On the Capacity of Networks with Correlated Sources
Satyajit Thakor, Terence Chan, Alex Grant
Characterizing the capacity region for a network can be extremely difficult. Even with independent sources, determining the capacity region can be as hard as the open problem of ch…
Symmetry in Distributed Storage Systems
Satyajit Thakor, Terence Chan, Kenneth W. Shum
The max-flow outer bound is achievable by regenerating codes for functional repair distributed storage system. However, the capacity of exact repair distributed storage system is a…
Cut-Set Bounds on Network Information Flow
Satyajit Thakor, Alex Grant, Terence Chan
Explicit characterization of the capacity region of communication networks is a long standing problem. While it is known that network coding can outperform routing and replication,…
Network Coding Capacity: A Functional Dependence Bound
Satyajit Thakor, Alex Grant, Terence Chan
Explicit characterization and computation of the multi-source network coding capacity region (or even bounds) is long standing open problem. In fact, finding the capacity region re…