跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+91新增 AI 导读

arXiv 最近完成扫描:2026-11-22 21:02 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-21 23:59 — 2026-11-22 23:59(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-22 21:02最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-22 21:00(北京时间)
版本更新 · v2arXiv:2605.04618

Constructions of locally repairable codes via concatenated codes

Hengfeng Jin, Fang-Wei Fu

原文摘要

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=2$ and disjoint local repair groups via classical concatenation, where the outer codes are linear codes over $\mathbb{F}_4$ and the inner code is the binary $[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=2$ and disjoint local repair groups, and define nearly perfect binary LRCs and $k$-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 $\mathbb{F}_4$. Finally, we present several examples of such nearly perfect and $k$-optimal binary LRCs.

cs.IT