activity
20092020
most citedOn Characterization of Entropic Vectors at the Boundary of Almost Entropic Cones

8 citations · 12 across the 4 of their papers we have counts for

collaborators

8 papers

cs.IT2020

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…

cs.IT2020

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…

cs.IT20208 cited

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…

cs.IT2018

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…

cs.IT2017

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…

cs.IT2016

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…