8 citations · 13 across the 2 of their papers we have counts for
2 papers
cs.IT2016★ 8 cited
Explicit Polyhedral Bounds on Network Coding Rate Regions via Entropy Function Region: Algorithms, Symmetry, and Computation
Jayant Apte, John MacLaren Walsh
Automating the solutions of multiple network information theory problems, stretching from fundamental concerns such as determining all information inequalities and the limitations…
cs.IT2016★ 5 cited
Constrained Linear Representability of Polymatroids and Algorithms for Computing Achievability Proofs in Network Coding
Jayant Apte, John MacLaren Walsh
The constrained linear representability problem (CLRP) for polymatroids determines whether there exists a polymatroid that is linear over a specified field while satisfying a colle…