最优三元局部可修复代码

IF 1.4 2区数学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Designs, Codes and Cryptography Pub Date : 2024-06-13 DOI:10.1007/s10623-024-01409-7

Jie Hao, Shu-Tao Xia, Kenneth W. Shum, Bin Chen, Fang-Wei Fu, Yixian Yang

{"title":"最优三元局部可修复代码","authors":"Jie Hao, Shu-Tao Xia, Kenneth W. Shum, Bin Chen, Fang-Wei Fu, Yixian Yang","doi":"10.1007/s10623-024-01409-7","DOIUrl":null,"url":null,"abstract":"<p>Locally repairable codes (LRCs) are linear codes with locality properties for code symbols, which have important applications in distributed storage systems. In this paper, we completely classify all the possible code parameters of optimal ternary LRCs achieving the Singleton-like bound proposed by Gopalan et al. Explicit constructions of optimal ternary LRCs are given for each group of possible code parameters. Moreover, it is also proved that optimal ternary LRCs with maximal minimum distance 6 are unique up to the equivalence of linear codes.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":null,"pages":null},"PeriodicalIF":1.4000,"publicationDate":"2024-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimal ternary locally repairable codes\",\"authors\":\"Jie Hao, Shu-Tao Xia, Kenneth W. Shum, Bin Chen, Fang-Wei Fu, Yixian Yang\",\"doi\":\"10.1007/s10623-024-01409-7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Locally repairable codes (LRCs) are linear codes with locality properties for code symbols, which have important applications in distributed storage systems. In this paper, we completely classify all the possible code parameters of optimal ternary LRCs achieving the Singleton-like bound proposed by Gopalan et al. Explicit constructions of optimal ternary LRCs are given for each group of possible code parameters. Moreover, it is also proved that optimal ternary LRCs with maximal minimum distance 6 are unique up to the equivalence of linear codes.</p>\",\"PeriodicalId\":11130,\"journal\":{\"name\":\"Designs, Codes and Cryptography\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2024-06-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Designs, Codes and Cryptography\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10623-024-01409-7\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Designs, Codes and Cryptography","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10623-024-01409-7","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

局部可修复代码（LRC）是一种具有代码符号局部性的线性代码，在分布式存储系统中有着重要的应用。在本文中，我们对达到 Gopalan 等人提出的类似 Singleton- 界值的最优三元 LRC 的所有可能代码参数进行了完整分类，并给出了每组可能代码参数的最优三元 LRC 的明确构造。此外，还证明了具有最大最小距离 6 的最优三元 LRC 在线性编码的等价性上是唯一的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Optimal ternary locally repairable codes

Locally repairable codes (LRCs) are linear codes with locality properties for code symbols, which have important applications in distributed storage systems. In this paper, we completely classify all the possible code parameters of optimal ternary LRCs achieving the Singleton-like bound proposed by Gopalan et al. Explicit constructions of optimal ternary LRCs are given for each group of possible code parameters. Moreover, it is also proved that optimal ternary LRCs with maximal minimum distance 6 are unique up to the equivalence of linear codes.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Designs, Codes and Cryptography 工程技术-计算机：理论方法

CiteScore

2.80

自引率

12.50%

发文量

157

审稿时长

16.5 months

期刊介绍： Designs, Codes and Cryptography is an archival peer-reviewed technical journal publishing original research papers in the designated areas. There is a great deal of activity in design theory, coding theory and cryptography, including a substantial amount of research which brings together more than one of the subjects. While many journals exist for each of the individual areas, few encourage the interaction of the disciplines. The journal was founded to meet the needs of mathematicians, engineers and computer scientists working in these areas, whose interests extend beyond the bounds of any one of the individual disciplines. The journal provides a forum for high quality research in its three areas, with papers touching more than one of the areas especially welcome. The journal also considers high quality submissions in the closely related areas of finite fields and finite geometries, which provide important tools for both the construction and the actual application of designs, codes and cryptographic systems. In particular, it includes (mostly theoretical) papers on computational aspects of finite fields. It also considers topics in sequence design, which frequently admit equivalent formulations in the journal’s main areas. Designs, Codes and Cryptography is mathematically oriented, emphasizing the algebraic and geometric aspects of the areas it covers. The journal considers high quality papers of both a theoretical and a practical nature, provided they contain a substantial amount of mathematics.