权重少的加法代码

Cryptography and Communications Pub Date : 2024-05-09 DOI:10.1007/s12095-024-00720-3

Daniel Panario, Murat Sahin, Qiang Wang

{"title":"权重少的加法代码","authors":"Daniel Panario, Murat Sahin, Qiang Wang","doi":"10.1007/s12095-024-00720-3","DOIUrl":null,"url":null,"abstract":"<p>Additive codes have a wide range of applications. A classical nice and generic way to construct linear codes is via trace functions. In this paper, first, we generalize this method to construct additive codes. Then, we use this method to get some explicit additive codes. Computing Weil-like sums, we obtain parameters of these codes such as the length and weight distribution. We show that our codes have few weights.</p>","PeriodicalId":10788,"journal":{"name":"Cryptography and Communications","volume":"44 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Additive codes with few weights\",\"authors\":\"Daniel Panario, Murat Sahin, Qiang Wang\",\"doi\":\"10.1007/s12095-024-00720-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Additive codes have a wide range of applications. A classical nice and generic way to construct linear codes is via trace functions. In this paper, first, we generalize this method to construct additive codes. Then, we use this method to get some explicit additive codes. Computing Weil-like sums, we obtain parameters of these codes such as the length and weight distribution. We show that our codes have few weights.</p>\",\"PeriodicalId\":10788,\"journal\":{\"name\":\"Cryptography and Communications\",\"volume\":\"44 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-05-09\",\"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-00720-3\",\"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-00720-3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

加法编码应用广泛。通过迹函数构造线性编码是一种经典的通用方法。在本文中，我们首先将这种方法推广到构造加法码中。然后，我们用这种方法得到一些显式加法码。通过计算类韦尔和，我们得到了这些编码的参数，如长度和权重分布。我们的研究表明，我们的编码只有很少的权值。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Additive codes with few weights

Additive codes have a wide range of applications. A classical nice and generic way to construct linear codes is via trace functions. In this paper, first, we generalize this method to construct additive codes. Then, we use this method to get some explicit additive codes. Computing Weil-like sums, we obtain parameters of these codes such as the length and weight distribution. We show that our codes have few weights.

求助全文

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

来源期刊

Cryptography and Communications

自引率

0.00%

发文量