On the Combinatorics of Locally Repairable Codes via Matroid Theory
IEEE Transactions on Information Theory(2016)
摘要
This paper provides a link between matroid theory and locally repairable codes (LRCs) that are either linear or more generally almost affine. Using this link, new results on both LRCs and matroid theory are derived. The parameters (n, k, d, r, δ) of LRCs are generalized to matroids, and the matroid analog of the generalized singleton bound by Gopalan et al. for linear LRCs is given for matroids. I...
更多查看译文
关键词
Maintenance engineering,Linear codes,Electronic mail,Mathematics,Cloud computing
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要