← 研踪 PaperTrailarXiv:2611.17765 · v1
Toward the Minimal Set of Information Inequalities in Regenerating Codes: An Algebraic Approach
首次提交 2026-11-13 13:24
版本更新 2026-11-13 13:24
雷达观测 2026-11-17 04:57
摘要
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 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 , count its entropy coordinates, and derive an explicitly computable upper bound on its number of inequalities. For every , 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 verify the reported system sizes.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-13 13:24 · 最新观测版本
Toward the Minimal Set of Information Inequalities in Regenerating Codes: An Algebraic Approach
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 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 , count its entropy coordinates, and derive an explicitly computable upper bound on its number of inequalities. For every , 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 verify the reported system sizes.
查看此版本解读 →查看此版本原文 ↗