跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2605.04618 · v2

Constructions of locally repairable codes via concatenated codes

首次提交 2026-05-06 16:07
版本更新 2026-11-07 21:35
雷达观测 2026-11-10 11:14
arXiv ↗PDF ↗

摘要

Locally repairable codes (LRCs) have attracted considerable attention owing to their pivotal role in distributed storage systems. Since binary linear LRCs can significantly reduce the complexity of both encoding and decoding, the construction of binary LRCs has drawn extensive research interest. In this paper, we construct binary LRCs with locality r=2r=2 and disjoint local repair groups via classical concatenation, where the outer codes are linear codes over F4\mathbb{F}_4 and the inner code is the binary [3,2,2][3,2,2] linear code. We present a systematic approach for selecting outer codes to obtain LRCs attaining specified bounds, and show that the weight distributions of the resulting binary LRCs are determined by those of the selected outer codes. Under certain sufficient conditions, we construct several classes of optimal binary LRCs, including those attaining Griesmer-type bounds and binary perfect LRCs. Furthermore, we sharpen the Johnson-like bounds of Ma and Ge for binary LRCs with locality r=2r=2 and disjoint local repair groups, and define nearly perfect binary LRCs and kk-optimal binary LRCs with respect to the improved bounds. We show that nearly perfect binary LRCs can be constructed via concatenation when the outer codes are nearly perfect linear codes over F4\mathbb{F}_4. Finally, we present several examples of such nearly perfect and kk-optimal binary LRCs.

作者备注:Revised several proofs and added two examples attaining the refined dimension bound at parameters where it is strictly tighter than the Ma-Ge bound

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-07 21:35 · 最新观测版本

Constructions of locally repairable codes via concatenated codes

Locally repairable codes (LRCs) have attracted considerable attention owing to their pivotal role in distributed storage systems. Since binary linear LRCs can significantly reduce the complexity of both encoding and decoding, the construction of binary LRCs has drawn extensive research interest. In this paper, we construct binary LRCs with locality r=2r=2 and disjoint local repair groups via classical concatenation, where the outer codes are linear codes over F4\mathbb{F}_4 and the inner code is the binary [3,2,2][3,2,2] linear code. We present a systematic approach for selecting outer codes to obtain LRCs attaining specified bounds, and show that the weight distributions of the resulting binary LRCs are determined by those of the selected outer codes. Under certain sufficient conditions, we construct several classes of optimal binary LRCs, including those attaining Griesmer-type bounds and binary perfect LRCs. Furthermore, we sharpen the Johnson-like bounds of Ma and Ge for binary LRCs with locality r=2r=2 and disjoint local repair groups, and define nearly perfect binary LRCs and kk-optimal binary LRCs with respect to the improved bounds. We show that nearly perfect binary LRCs can be constructed via concatenation when the outer codes are nearly perfect linear codes over F4\mathbb{F}_4. Finally, we present several examples of such nearly perfect and kk-optimal binary LRCs.

查看此版本解读 →查看此版本原文 ↗