When Does the Extended Code of an MDS Code Remain MDS?

IF 2.2 3区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Information Theory Pub Date : 2024-11-11 DOI:10.1109/TIT.2024.3494813
Yansheng Wu;Cunsheng Ding;Tingfang Chen
{"title":"When Does the Extended Code of an MDS Code Remain MDS?","authors":"Yansheng Wu;Cunsheng Ding;Tingfang Chen","doi":"10.1109/TIT.2024.3494813","DOIUrl":null,"url":null,"abstract":"For a given linear code \n<inline-formula> <tex-math>$\\mathcal {C}$ </tex-math></inline-formula>\n of length n over \n<inline-formula> <tex-math>${\\mathrm {GF}}(q)$ </tex-math></inline-formula>\n and a nonzero vector u in \n<inline-formula> <tex-math>${\\mathrm {GF}}(q)^{n}$ </tex-math></inline-formula>\n, Sun, Ding and Chen defined an extended linear code \n<inline-formula> <tex-math>$\\overline {\\mathcal {C}}({\\mathbf {u}})$ </tex-math></inline-formula>\n of \n<inline-formula> <tex-math>$\\mathcal {C}$ </tex-math></inline-formula>\n, which is a generalisation of the classical extended code \n<inline-formula> <tex-math>$\\overline {\\mathcal {C}}(-{\\mathbf {1}})$ </tex-math></inline-formula>\n of \n<inline-formula> <tex-math>$\\mathcal {C}$ </tex-math></inline-formula>\n and called the second kind of an extended code of \n<inline-formula> <tex-math>$\\mathcal {C}$ </tex-math></inline-formula>\n (see Finite Fields Appl., vol. 96, 102401, 2024 and Discrete Math., vol. 347, no. 9, 114080, 2024). They developed some general theory of the extended codes \n<inline-formula> <tex-math>$\\overline {\\mathcal {C}}({\\mathbf {u}})$ </tex-math></inline-formula>\n and studied the extended codes \n<inline-formula> <tex-math>$\\overline {\\mathcal {C}}({\\mathbf {u}})$ </tex-math></inline-formula>\n of several families of linear codes, including cyclic codes, projective two-weight codes, nonbinary Hamming codes, and a family of reversible MDS cyclic codes. The objective of this paper is to investigate the extended codes \n<inline-formula> <tex-math>$\\overline {\\mathcal {C}}({\\mathbf {u}})$ </tex-math></inline-formula>\n of MDS codes \n<inline-formula> <tex-math>$\\mathcal {C}$ </tex-math></inline-formula>\n over finite fields. The main result of this paper is that the extended code \n<inline-formula> <tex-math>$\\overline {\\mathcal {C}}({\\mathbf {u}})$ </tex-math></inline-formula>\n of an MDS \n<inline-formula> <tex-math>$[n,k]$ </tex-math></inline-formula>\n code \n<inline-formula> <tex-math>$\\mathcal {C}$ </tex-math></inline-formula>\n remains MDS if and only if the covering radius \n<inline-formula> <tex-math>$\\rho (\\mathcal {C}^{\\bot })=k$ </tex-math></inline-formula>\n and the vector u is a deep hole of the dual code \n<inline-formula> <tex-math>${\\mathcal {C}}^{\\perp } $ </tex-math></inline-formula>\n. As applications of this main result, an equivalent statement of MDS Conjecture is presented, the extended codes of the GRS codes and extended GRS codes are investigated, and the covering radii and some deep holes of several families of MDS codes are also determined.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 1","pages":"263-272"},"PeriodicalIF":2.2000,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Theory","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10750010/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

For a given linear code $\mathcal {C}$ of length n over ${\mathrm {GF}}(q)$ and a nonzero vector u in ${\mathrm {GF}}(q)^{n}$ , Sun, Ding and Chen defined an extended linear code $\overline {\mathcal {C}}({\mathbf {u}})$ of $\mathcal {C}$ , which is a generalisation of the classical extended code $\overline {\mathcal {C}}(-{\mathbf {1}})$ of $\mathcal {C}$ and called the second kind of an extended code of $\mathcal {C}$ (see Finite Fields Appl., vol. 96, 102401, 2024 and Discrete Math., vol. 347, no. 9, 114080, 2024). They developed some general theory of the extended codes $\overline {\mathcal {C}}({\mathbf {u}})$ and studied the extended codes $\overline {\mathcal {C}}({\mathbf {u}})$ of several families of linear codes, including cyclic codes, projective two-weight codes, nonbinary Hamming codes, and a family of reversible MDS cyclic codes. The objective of this paper is to investigate the extended codes $\overline {\mathcal {C}}({\mathbf {u}})$ of MDS codes $\mathcal {C}$ over finite fields. The main result of this paper is that the extended code $\overline {\mathcal {C}}({\mathbf {u}})$ of an MDS $[n,k]$ code $\mathcal {C}$ remains MDS if and only if the covering radius $\rho (\mathcal {C}^{\bot })=k$ and the vector u is a deep hole of the dual code ${\mathcal {C}}^{\perp } $ . As applications of this main result, an equivalent statement of MDS Conjecture is presented, the extended codes of the GRS codes and extended GRS codes are investigated, and the covering radii and some deep holes of several families of MDS codes are also determined.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
MDS的扩展码什么时候仍然是MDS?
对于给定长度为n / ${\mathrm {GF}}(q)$的线性码$\mathcal {C}$和${\mathrm {GF}}(q)^{n}$中的非零向量u, Sun、Ding和Chen定义了$\mathcal {C}$的扩展线性码$\overline {\mathcal {C}}({\mathbf {u}})$,这是对$\mathcal {C}$的经典扩展码$\overline {\mathcal {C}}(-{\mathbf {1}})$的推广,称为$\mathcal {C}$的第二类扩展码(参见有限域应用)。数学,vol. 96, 102401, 2024和离散数学。,第347卷,no。9, 114080,2024)。他们发展了一些扩展码的一般理论$\overline {\mathcal {C}}({\mathbf {u}})$,并研究了几种线性码族的扩展码$\overline {\mathcal {C}}({\mathbf {u}})$,包括循环码、投影二权码、非二进制汉明码和可逆MDS循环码族。本文的目的是研究有限域上MDS码$\mathcal {C}$的扩展码$\overline {\mathcal {C}}({\mathbf {u}})$。本文的主要结论是当且仅当覆盖半径$\rho (\mathcal {C}^{\bot })=k$且向量u为双码${\mathcal {C}}^{\perp } $的深孔时,MDS的扩展码$\overline {\mathcal {C}}({\mathbf {u}})$$[n,k]$码$\mathcal {C}$仍然是MDS。作为这一主要结果的应用,给出了MDS猜想的等价表述,研究了GRS码和扩展GRS码的扩展码,并确定了几种MDS码族的覆盖半径和一些深孔。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory 工程技术-工程:电子与电气
CiteScore
5.70
自引率
20.00%
发文量
514
审稿时长
12 months
期刊介绍: The IEEE Transactions on Information Theory is a journal that publishes theoretical and experimental papers concerned with the transmission, processing, and utilization of information. The boundaries of acceptable subject matter are intentionally not sharply delimited. Rather, it is hoped that as the focus of research activity changes, a flexible policy will permit this Transactions to follow suit. Current appropriate topics are best reflected by recent Tables of Contents; they are summarized in the titles of editorial areas that appear on the inside front cover.
期刊最新文献
Table of Contents IEEE Transactions on Information Theory Publication Information Interference Networks With Random User Activity and Heterogeneous Delay Constraints Table of Contents IEEE Transactions on Information Theory Information for Authors
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1