Foundations of additive codes over finite fields

IF 1.2 3区数学 Q1 MATHEMATICS

Finite Fields and Their Applications Pub Date : 2025-02-19 DOI:10.1016/j.ffa.2025.102592

Dipak K. Bhunia , Steven T. Dougherty , Cristina Fernández-Córdoba , Mercè Villanueva

引用次数: 0

Abstract

Additive codes were initially introduced by Delsarte in 1973 within the context of association schemes and recently they have become of interest due to their application in constructing quantum error-correcting codes.

We give foundational results for additive codes where the elements are from a finite field, and define the orthogonality relation using group characters. We introduce a type for these additive codes and explore the notion of independence for a generating set. Additionally, we provide a definition for a generator matrix of an additive code based on its type. We also relate the type of an additive code to the type of its orthogonal. We study a family of kernels and ranks associated with these additive codes. We relate the equivalence of additive codes to their type, the family of kernels and ranks, and duality. We see how these relations contribute in the classification of additive codes. Finally, we provide a general encoding and decoding method for these codes.

查看原文本刊更多论文

求助全文

约1分钟内获得全文求助全文

来源期刊

Finite Fields and Their Applications 数学-数学

CiteScore

2.00

自引率

20.00%

发文量

133

审稿时长

6-12 weeks

期刊介绍： 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.