新的无限族的近MDS码持有$t$-设计和最优的局部可恢复码

SIAM J. Discret. Math. Pub Date : 2022-10-11 DOI:10.48550/arXiv.2210.05194

Ziling Heng, Xinran Wang

{"title":"新的无限族的近MDS码持有$t$-设计和最优的局部可恢复码","authors":"Ziling Heng, Xinran Wang","doi":"10.48550/arXiv.2210.05194","DOIUrl":null,"url":null,"abstract":"In ``Infinite families of near MDS codes holding $t$-designs, IEEE Trans. Inform. Theory, 2020, 66(9), pp. 5419-5428'', Ding and Tang made a breakthrough in constructing the first two infinite families of NMDS codes holding $2$-designs or $3$-designs. Up to now, there are only a few known infinite families of NMDS codes holding $t$-designs in the literature. The objective of this paper is to construct new infinite families of NMDS codes holding $t$-designs. We determine the weight enumerators of the NMDS codes and prove that the NMDS codes hold $2$-designs or $3$-designs. Compared with known $t$-designs from NMDS codes, ours have different parameters. Besides, several infinite families of optimal locally recoverable codes are also derived via the NMDS codes.","PeriodicalId":21749,"journal":{"name":"SIAM J. Discret. Math.","volume":"182 1","pages":"113538"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"New infinite families of near MDS codes holding $t$-designs and optimal locally recoverable codes\",\"authors\":\"Ziling Heng, Xinran Wang\",\"doi\":\"10.48550/arXiv.2210.05194\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In ``Infinite families of near MDS codes holding $t$-designs, IEEE Trans. Inform. Theory, 2020, 66(9), pp. 5419-5428'', Ding and Tang made a breakthrough in constructing the first two infinite families of NMDS codes holding $2$-designs or $3$-designs. Up to now, there are only a few known infinite families of NMDS codes holding $t$-designs in the literature. The objective of this paper is to construct new infinite families of NMDS codes holding $t$-designs. We determine the weight enumerators of the NMDS codes and prove that the NMDS codes hold $2$-designs or $3$-designs. Compared with known $t$-designs from NMDS codes, ours have different parameters. Besides, several infinite families of optimal locally recoverable codes are also derived via the NMDS codes.\",\"PeriodicalId\":21749,\"journal\":{\"name\":\"SIAM J. Discret. Math.\",\"volume\":\"182 1\",\"pages\":\"113538\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIAM J. Discret. Math.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.48550/arXiv.2210.05194\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM J. Discret. Math.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2210.05194","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

在“持有$t$-设计的无限族近MDS码”中，IEEE Trans。通知。“理论，2020,66(9)，pp. 5419-5428”，Ding和Tang在构造前两个具有$2$-设计或$3$-设计的无限族NMDS代码方面取得了突破。到目前为止，文献中已知的具有$t$-设计的无限族NMDS码很少。本文的目的是构造具有$t$-设计的新的无限族NMDS码。我们确定了NMDS码的权重枚举数，并证明了NMDS码持有$2$设计或$3$设计。与NMDS规范中已知的$t$-设计相比，我们的设计具有不同的参数。此外，还利用NMDS码导出了若干无限族的最优局部可恢复码。

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

查看原文本刊更多论文

New infinite families of near MDS codes holding $t$-designs and optimal locally recoverable codes

In ``Infinite families of near MDS codes holding $t$-designs, IEEE Trans. Inform. Theory, 2020, 66(9), pp. 5419-5428'', Ding and Tang made a breakthrough in constructing the first two infinite families of NMDS codes holding $2$-designs or $3$-designs. Up to now, there are only a few known infinite families of NMDS codes holding $t$-designs in the literature. The objective of this paper is to construct new infinite families of NMDS codes holding $t$-designs. We determine the weight enumerators of the NMDS codes and prove that the NMDS codes hold $2$-designs or $3$-designs. Compared with known $t$-designs from NMDS codes, ours have different parameters. Besides, several infinite families of optimal locally recoverable codes are also derived via the NMDS codes.

求助全文

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

来源期刊

SIAM J. Discret. Math.

自引率

0.00%

发文量