Network coding and the model theory of linear information inequalities

No abstract is available for this paper.

• Publication year

  2014

• Venue

  International Symposium on Network Coding

• Publication date

  2014-06-27

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/NETCOD.2014.6892127
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Linear network coding and the model theory of linear rank inequalities

  2014cited by this paper
• Non-Shannon Information Inequalities in Four Random Variables

  2013influential reference
• Multiple unicasts, graph guessing games, and non-Shannon inequalities

  2013cited by this paper
• Entropy Region and Convolution

  2013cited by this paper
• Network Coding Theory: A Survey

  2013cited by this paper
• Index Coding Capacity: How Far Can One Go With Only Shannon Inequalities?

  2013cited by this paper
• An Implicit Characterization of the Achievable Rate Region for Acyclic Multisource Multisink Network Coding

  2012cited by this paper
• Secret Sharing and Non-Shannon Information Inequalities

  2009cited by this paper
• Moments and sums of squares for polynomial optimization and related problems

  2009cited by this paper
• Size and treewidth bounds for conjunctive queries

  2009cited by this paper
• Non-linear Information Inequalities

  2008influential reference
• A projection method for derivation of non-Shannon-type information inequalities

  2008cited by this paper
• Networks, Matroids, and Non-Shannon Information Inequalities

  2007influential reference
• Infinitely Many Information Inequalities

  2007influential reference
• Two Constructions on Limits of Entropy Functions

  2007cited by this paper
• Six New Non-Shannon Information Inequalities

  2006cited by this paper
• A First Course in Information Theory

  2002influential reference
• Tame Topology and O-minimal Structures

  1998influential reference
• On characterization of entropy function via information inequalities

  1998cited by this paper
• Complexity and Real Computation

  1997cited by this paper
• The Size of a Share Must Be Large

  1994cited by this paper

• First-Order Theory of Probabilistic Independence and Single-Letter Characterizations of Capacity Regions

  2023cites this paper
• An Automated Theorem Proving Framework for Information-Theoretic Results

  2023cites this paper
• Undecidability of Network Coding, Conditional Information Inequalities, and Conditional Independence Implication

  2022cites this paper
• The Undecidability of Conditional Affine Information Inequalities and Conditional Independence Implication With a Binary Constraint

  2022cites this paper
• The Undecidability of Conditional Affine Information Inequalities and Conditional Independence Implication with a Binary Constraint

  2021cites this paper
• An Automated Theorem Proving Framework for Information-Theoretic Results

  2021cites this paper
• First-Order Theory of Probabilistic Independence and Single-Letter Characterizations of Capacity Regions

  2021cites this paper
• The Undecidability of Network Coding with some Fixed-Size Messages and Edges

  2021cites this paper
• Linear Network Coding over Ring Alphabets

  2018cites this paper
• Linear Capacity of Networks over Ring Alphabets

  2017cites this paper
• Capacity and Achievable Rate Regions for Linear Network Coding Over Ring Alphabets

  2017cites this paper
• Defining the almost-entropic regions by algebraic inequalities

  2017cites this paper
• The almost-entropic regions are not semialgebraic

  2015cites this paper
• Linear network coding and the model theory of linear rank inequalities

  2014cites this paper