{"title":"Some new classes of additive MDS and almost MDS codes over finite fields","authors":"Monika Yadav , Anuradha Sharma","doi":"10.1016/j.ffa.2024.102394","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, we introduce and study two new classes of additive codes over finite fields, <em>viz.</em> additive generalized Reed-Solomon (additive GRS) codes and additive generalized twisted Reed-Solomon (additive GTRS) codes, which are extensions of linear generalized Reed-Solomon (GRS) codes and twisted Reed-Solomon (GTRS) codes, respectively. Unlike linear GRS codes, additive GRS codes are not maximum distance separable (MDS) codes and the dual of an additive GRS code need not be an additive GRS code in general. We derive necessary and sufficient conditions under which an additive GRS code is MDS. We further apply this result to identify several new classes of additive MDS codes and a class of additive MDS codes whose dual codes are also MDS within the family of additive GRS codes. We also identify several new classes of additive codes that are either MDS or almost MDS within the family of additive GTRS codes. We also obtain several classes of additive TRS codes that are not monomially equivalent to additive RS codes. Besides this, we identify classes of monomially inequivalent additive MDS TRS codes and additive MDS RS codes, whose dual codes are also MDS. We also provide methods to construct additive MDS self-orthogonal, self-dual, and ACD codes through additive GRS and GTRS codes. Based on additive MDS codes whose dual codes are also MDS, we present a perfect threshold secret-sharing scheme that can detect cheating, identify a certain number of cheaters among the participants, and correctly recover the secret.</p></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":null,"pages":null},"PeriodicalIF":1.2000,"publicationDate":"2024-02-27","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/S1071579724000339","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we introduce and study two new classes of additive codes over finite fields, viz. additive generalized Reed-Solomon (additive GRS) codes and additive generalized twisted Reed-Solomon (additive GTRS) codes, which are extensions of linear generalized Reed-Solomon (GRS) codes and twisted Reed-Solomon (GTRS) codes, respectively. Unlike linear GRS codes, additive GRS codes are not maximum distance separable (MDS) codes and the dual of an additive GRS code need not be an additive GRS code in general. We derive necessary and sufficient conditions under which an additive GRS code is MDS. We further apply this result to identify several new classes of additive MDS codes and a class of additive MDS codes whose dual codes are also MDS within the family of additive GRS codes. We also identify several new classes of additive codes that are either MDS or almost MDS within the family of additive GTRS codes. We also obtain several classes of additive TRS codes that are not monomially equivalent to additive RS codes. Besides this, we identify classes of monomially inequivalent additive MDS TRS codes and additive MDS RS codes, whose dual codes are also MDS. We also provide methods to construct additive MDS self-orthogonal, self-dual, and ACD codes through additive GRS and GTRS codes. Based on additive MDS codes whose dual codes are also MDS, we present a perfect threshold secret-sharing scheme that can detect cheating, identify a certain number of cheaters among the participants, and correctly recover the secret.
期刊介绍：
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
