Weight Distributions of Two Classes of Optimal $(r, \delta)$-Locally Repairable Codes

An <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(r,\ \delta)$</tex> -locally repairable code (LRC) is an <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$[n,\ k,\ d]$</tex> linear code that permits the reconstruction of each code symbol by accessing up to <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$r$</tex> other symbols in the event of at most <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\delta-1$</tex> erasures. In this paper, by characterizing the weight type hierarchy of codewords, we offer explicit expressions of the weight distributions for q-ary optimal <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(r=2,\ \delta)$</tex> -LRCs with minimum distance <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$2\delta+1$</tex> and even code dimension, as well as for <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(r,\ \delta)$</tex> -LRCs with minimum distance <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\delta+1$</tex> under the condition that <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k\geq 5r-1$</tex>. These corresponding parameter conditions ensure all the <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(r,\ \delta)$</tex> -LRCs we studied possess disjoint locality groups. Furthermore, we demonstrate that the weight distributions of optimal <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(r=2,\ \delta)$</tex> -LRCs can be uniquely determined only for specific minimum distances of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\delta, \delta+1$</tex> or <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$2\delta+1$</tex>.

Authors

Institutions

Publication Details

Published
2024-11-24
DOI
https://doi.org/10.1109/itw61385.2024.10806976
Primary Topic
Advanced Data Storage Technologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Weight Distributions of Two Classes of Optimal $(r, \delta)$-Locally Repairable Codes

Yao Tian, Fang‐Wei Fu, Hengfeng Jin
Advanced Data Storage Technologies
article

Weight Distributions of Two Classes of Optimal $(r, \delta)$-Locally Repairable Codes

Yao Tian, Fang‐Wei Fu, Hengfeng Jin
article en

Abstract

An <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(r,\ \delta)$</tex> -locally repairable code (LRC) is an <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$[n,\ k,\ d]$</tex> linear code that permits the reconstruction of each code symbol by accessing up to <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$r$</tex> other symbols in the event of at most <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\delta-1$</tex> erasures. In this paper, by characterizing the weight type hierarchy of codewords, we offer explicit expressions of the weight distributions for q-ary optimal <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(r=2,\ \delta)$</tex> -LRCs with minimum distance <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$2\delta+1$</tex> and even code dimension, as well as for <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(r,\ \delta)$</tex> -LRCs with minimum distance <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\delta+1$</tex> under the condition that <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k\geq 5r-1$</tex>. These corresponding parameter conditions ensure all the <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(r,\ \delta)$</tex> -LRCs we studied possess disjoint locality groups. Furthermore, we demonstrate that the weight distributions of optimal <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(r=2,\ \delta)$</tex> -LRCs can be uniquely determined only for specific minimum distances of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\delta, \delta+1$</tex> or <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$2\delta+1$</tex>.

Nankai University (CN)
Openalex Percentile: Top 72%
Advanced Data Storage Technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.