EUVIMEDEUVIMED entdecken
Crossref

New Lower Bounds for the Minimum Distance of Cyclic Codes and Applications to Locally Repairable Codes

Jing Qiu, Weijun Fang, Fang-Wei Fu

IEEE Transactions on Information Theory · 2024-07 · 70 (7) · 4968-4982

DOI: 10.1109/tit.2024.3349560 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2024-07. Verfasst von Jing Qiu und 2 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 27 Literaturangaben. Gefördert von: National Key Research and Development Program of China, National Natural Science Foundation of China, Natural Science Foundation of Shandong Province.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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 basic results have been developed on this topic. Recently, locally repairable codes (LRCs) have attracted much attention due to their repair efficiency in large-scale distributed storage systems. In this paper, by employing the singleton procedure technique, we first provide a sufficient condition for bounding the minimum distance of cyclic codes with typical defining sets. Secondly, by considering a specific case, we establish a connection between bounds for the minimum distance of cyclic codes and solutions to a system of inequalities. This connection leads to the derivation of new bounds, including some with general patterns. In particular, we provide three new bounds with general patterns, one of which serves as a generalization of the Betti-Sala bound. Finally, we present a generalized lower bound for a special case and construct several families of $(2, \delta)$ -LRCs with unbounded length and minimum distance $2\delta $ . It turns out that these LRCs are distance-optimal, and their parameters are new. To the best of our knowledge, this work represents the first construction of distance-optimal $(r, \delta)$ -LRCs with unbounded length and minimum distance exceeding $r+\delta -1$ .

Förderung

  • National Key Research and Development Program of China
  • National Natural Science Foundation of China
  • Natural Science Foundation of Shandong Province
  • Taishan Scholar Program of Shandong Province
  • Fundamental Research Funds for the Central Universities, Nankai University
  • Nankai Zhide Foundation

Zitieren

APA

Qiu, J., Fang, W., & Fu, F. (2024). New Lower Bounds for the Minimum Distance of Cyclic Codes and Applications to Locally Repairable Codes. IEEE Transactions on Information Theory, 70(7), 4968-4982. https://doi.org/10.1109/tit.2024.3349560

Vancouver

Qiu J, Fang W, Fu F. New Lower Bounds for the Minimum Distance of Cyclic Codes and Applications to Locally Repairable Codes. IEEE Transactions on Information Theory. 2024;70(7):4968-4982. doi:10.1109/tit.2024.3349560

BibTeX
@article{Qiu2024,
  author = {Qiu, Jing and Fang, Weijun and Fu, Fang-Wei},
  title = {New Lower Bounds for the Minimum Distance of Cyclic Codes and Applications to Locally Repairable Codes},
  journal = {IEEE Transactions on Information Theory},
  year = {2024},
  volume = {70},
  number = {7},
  pages = {4968--4982},
  doi = {10.1109/tit.2024.3349560}
}
Kostenlos starten →