首页|Constructions of optimal binary locally repairable codes via intersection subspaces

Constructions of optimal binary locally repairable codes via intersection subspaces

扫码查看
原文链接
  • NETL
  • NSTL
  • 万方数据
Locally repairable codes(LRCs),which can recover any symbol of a codeword by reading only a small number of other symbols,have been widely used in real-world distributed storage systems,such as Microsoft Azure Storage and Ceph Storage Cluster.Since binary linear LRCs can significantly reduce coding and decoding complexity,constructions of binary LRCs are of particular interest.The aim of this paper is to construct dimensional optimal binary LRCs with disjoint local repair groups.We introduce a method to connect intersection subspaces with binary LRCs and construct dimensional optimal binary linear LRCs with locality 2b(b≥3)and minimum distance d≥6 by employing intersection subspaces deduced from the direct sum.This method will sufficiently increase the number of possible repair groups of dimensional optimal LRCs,thus efficiently expanding the range of the construction parameters while keeping the largest code rates compared with all known binary linear LRCs with minimum distance d ≥ 6 and locality 2b.

locally repairable codesdisjoint local repair groupsdistributed storage systemsintersection subspacesdirect sum

Wenqin ZHANG、Deng TANG、Chenhao YING、Yuan LUO

展开 >

School of Electronic Information and Electrical Engineering,Shanghai Jiao Tong University,Shanghai 200240,China

National Key R&D Program of ChinaNational Key R&D Program of ChinaNational Natural Science Foundation of China

2022YFA10049002022YFA100500062272303

2024

10.1007/s11432-023-3863-y

中国科学:信息科学(英文版)
中国科学院

中国科学:信息科学(英文版)

CSTPCDEI
影响因子：0.715
ISSN：1674-733X
年,卷(期)：2024.67(6)
  • 1