New Lower Bounds for the Minimum Distance of Cyclic Codes and Applications to Locally Repairable Codes
J Qiu, W Fang, FW Fu - IEEE Transactions on Information …, 2024 - ieeexplore.ieee.org
Cyclic codes are an important class of linear codes. Bounding the minimum distance of
cyclic codes is a long-standing research topic in coding theory, and several well-known and …
cyclic codes is a long-standing research topic in coding theory, and several well-known and …
Some New Results on Improved Bounds and Constructions of Singleton-Optimal (r, δ) Locally Repairable Codes
R Tao, W Fang, Y Wang, FW Fu… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
In this paper, we focus on Singleton-optimal (r, δ) LRCs with disjoint local repair groups. We
provide an improved bound for the length of q-ary Singleton-optimal (r, δ) LRCs based on …
provide an improved bound for the length of q-ary Singleton-optimal (r, δ) LRCs based on …
Weight Distributions of Two Classes of Optimal -Locally Repairable Codes
Y Tian, H Jin, FW Fu - 2024 IEEE Information Theory Workshop …, 2024 - ieeexplore.ieee.org
An (r,\delta)-locally repairable code (LRC) is an n,\k,\d linear code that permits the
reconstruction of each code symbol by accessing up to r other symbols in the event of at …
reconstruction of each code symbol by accessing up to r other symbols in the event of at …