A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
On the Weight Hierarchy of Locally Repairable Codes
[article]
2017
arXiv
pre-print
An (n,k,r) locally repairable code (LRC) is an [n,k,d] linear code where every code symbol can be repaired from at most r other code symbols. An LRC is said to be optimal if the minimum distance attains the Singleton-like bound d < n-k- k/r +2. The generalized Hamming weights (GHWs) of linear codes are fundamental parameters which have many useful applications. Generally it is difficult to determine the GHWs of linear codes. In this paper, we study the GHWs of LRCs. Firstly, we obtain a
arXiv:1702.05848v1
fatcat:3fv5lmncpzba7p5fg4lvhprtmu