{"title":"向量双弯曲函数的少权线性码","authors":"Zhicheng Wang , Qiang Wang , Shudi Yang","doi":"10.1016/j.ffa.2025.102660","DOIUrl":null,"url":null,"abstract":"<div><div>Linear codes with few weights have wide applications in secret sharing, authentication codes, strongly regular graphs and association schemes. In this paper, we present linear codes from vectorial dual-bent functions and permutation polynomials, such that their parameters and weight distributions can be explicitly determined. In particular, some of them are three-weight optimal or almost optimal codes. As applications, we extend these codes to construct self-orthogonal codes and show the existence of asymmetric quantum codes.</div></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"108 ","pages":"Article 102660"},"PeriodicalIF":1.2000,"publicationDate":"2025-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Linear codes with few weights from vectorial dual-bent functions\",\"authors\":\"Zhicheng Wang , Qiang Wang , Shudi Yang\",\"doi\":\"10.1016/j.ffa.2025.102660\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Linear codes with few weights have wide applications in secret sharing, authentication codes, strongly regular graphs and association schemes. In this paper, we present linear codes from vectorial dual-bent functions and permutation polynomials, such that their parameters and weight distributions can be explicitly determined. In particular, some of them are three-weight optimal or almost optimal codes. As applications, we extend these codes to construct self-orthogonal codes and show the existence of asymmetric quantum codes.</div></div>\",\"PeriodicalId\":50446,\"journal\":{\"name\":\"Finite Fields and Their Applications\",\"volume\":\"108 \",\"pages\":\"Article 102660\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2025-05-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Finite Fields and Their Applications\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1071579725000905\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Finite Fields and Their Applications","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1071579725000905","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
Linear codes with few weights from vectorial dual-bent functions
Linear codes with few weights have wide applications in secret sharing, authentication codes, strongly regular graphs and association schemes. In this paper, we present linear codes from vectorial dual-bent functions and permutation polynomials, such that their parameters and weight distributions can be explicitly determined. In particular, some of them are three-weight optimal or almost optimal codes. As applications, we extend these codes to construct self-orthogonal codes and show the existence of asymmetric quantum codes.
期刊介绍:
Finite Fields and Their Applications is a peer-reviewed technical journal publishing papers in finite field theory as well as in applications of finite fields. As a result of applications in a wide variety of areas, finite fields are increasingly important in several areas of mathematics, including linear and abstract algebra, number theory and algebraic geometry, as well as in computer science, statistics, information theory, and engineering.
For cohesion, and because so many applications rely on various theoretical properties of finite fields, it is essential that there be a core of high-quality papers on theoretical aspects. In addition, since much of the vitality of the area comes from computational problems, the journal publishes papers on computational aspects of finite fields as well as on algorithms and complexity of finite field-related methods.
The journal also publishes papers in various applications including, but not limited to, algebraic coding theory, cryptology, combinatorial design theory, pseudorandom number generation, and linear recurring sequences. There are other areas of application to be included, but the important point is that finite fields play a nontrivial role in the theory, application, or algorithm.