倾斜对称对偶上的 ACD 编码

Astha Agrawal, R. K. Sharma
{"title":"倾斜对称对偶上的 ACD 编码","authors":"Astha Agrawal, R. K. Sharma","doi":"10.1007/s12095-024-00709-y","DOIUrl":null,"url":null,"abstract":"<p>Additive codes have gained importance in algebraic coding theory due to their applications in quantum error correction and quantum computing. The article begins by developing some properties of Additive Complementary Dual (ACD) codes with respect to arbitrary dualities over finite abelian groups. Further, we introduce a subclass of non-symmetric dualities referred to as the skew-symmetric dualities. Then, we precisely count symmetric and skew-symmetric dualities over finite fields. Two conditions have been obtained: one is a necessary and sufficient condition, and the other is a necessary condition. The necessary and sufficient condition is for an additive code to be an ACD code over arbitrary dualities. The necessary condition is on a generator matrix of an ACD code over skew-symmetric dualities. We provide bounds for the highest possible minimum distance of ACD codes over skew-symmetric dualities. Finally, we find some new quaternary ACD codes over non-symmetric dualities with better parameters than the symmetric ones.</p>","PeriodicalId":10788,"journal":{"name":"Cryptography and Communications","volume":"81 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"ACD codes over skew-symmetric dualities\",\"authors\":\"Astha Agrawal, R. K. Sharma\",\"doi\":\"10.1007/s12095-024-00709-y\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Additive codes have gained importance in algebraic coding theory due to their applications in quantum error correction and quantum computing. The article begins by developing some properties of Additive Complementary Dual (ACD) codes with respect to arbitrary dualities over finite abelian groups. Further, we introduce a subclass of non-symmetric dualities referred to as the skew-symmetric dualities. Then, we precisely count symmetric and skew-symmetric dualities over finite fields. Two conditions have been obtained: one is a necessary and sufficient condition, and the other is a necessary condition. The necessary and sufficient condition is for an additive code to be an ACD code over arbitrary dualities. The necessary condition is on a generator matrix of an ACD code over skew-symmetric dualities. We provide bounds for the highest possible minimum distance of ACD codes over skew-symmetric dualities. Finally, we find some new quaternary ACD codes over non-symmetric dualities with better parameters than the symmetric ones.</p>\",\"PeriodicalId\":10788,\"journal\":{\"name\":\"Cryptography and Communications\",\"volume\":\"81 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-04-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Cryptography and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s12095-024-00709-y\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cryptography and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s12095-024-00709-y","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

由于在量子纠错和量子计算中的应用,加法码在代数编码理论中变得越来越重要。文章首先介绍了加法互补对偶(ACD)码在有限无性群上任意对偶方面的一些特性。此外,我们还介绍了一种非对称对偶性子类,称为偏斜对称对偶性。然后,我们精确计算了有限域上的对称和偏斜对称对偶性。我们得到了两个条件:一个是必要充分条件,另一个是必要条件。必要和充分条件是在任意对偶性上加法码是 ACD 码。必要条件是在偏斜对称对偶性上的 ACD 码的生成矩阵。我们提供了斜对称对偶性上 ACD 码的最大可能最小距离的边界。最后,我们发现了一些新的非对称对偶上的四元 ACD 码,其参数优于对称码。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
ACD codes over skew-symmetric dualities

Additive codes have gained importance in algebraic coding theory due to their applications in quantum error correction and quantum computing. The article begins by developing some properties of Additive Complementary Dual (ACD) codes with respect to arbitrary dualities over finite abelian groups. Further, we introduce a subclass of non-symmetric dualities referred to as the skew-symmetric dualities. Then, we precisely count symmetric and skew-symmetric dualities over finite fields. Two conditions have been obtained: one is a necessary and sufficient condition, and the other is a necessary condition. The necessary and sufficient condition is for an additive code to be an ACD code over arbitrary dualities. The necessary condition is on a generator matrix of an ACD code over skew-symmetric dualities. We provide bounds for the highest possible minimum distance of ACD codes over skew-symmetric dualities. Finally, we find some new quaternary ACD codes over non-symmetric dualities with better parameters than the symmetric ones.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信