arXiv · 2611.17765
Toward the Minimal Set of Information Inequalities in Regenerating Codes: An Algebraic Approach
Abstract
Information-theoretic outer bounds for exact-repair regenerating codes can be formulated as linear programs, but the associated Shannon-type systems contain many implicit equalities and redundant inequalities. We directly specify a reduced system for the $(n,n-1,n-1)$ exact-repair model using the closure structure induced by its repair dependencies. Nonempty closed sets index the reduced joint-entropy coordinates, and inseparable edges determine the defining inequalities. We prove equivalence with the initial system by characterizing its implicit equalities and establishing sufficient redundancy criteria. We also give an algorithm that constructs the directly defined system for any $n$, count its entropy coordinates, and derive an explicitly computable upper bound on its number of inequalities. For every $n\ge2$, we prove that the reduced system has no implicit equalities and that each distinct defining inequality is nonredundant and defines a facet in the nonempty closed-set coordinate space. Exact enumerations for $n\in\{2,3,4,5\}$ verify the reported system sizes.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Rui-Juan Jing, Laigang Guo, Yan-Feng Xie, Chun-Ming Yuan. 2026-11-13. Toward the Minimal Set of Information Inequalities in Regenerating Codes: An Algebraic Approach. https://searcharxiv.com/abs/2611.17765
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.