Self-dual 2-quasi negacyclic codes over finite fields

IF 1.2 3区数学 Q1 MATHEMATICS Finite Fields and Their Applications Pub Date : 2024-11-07 DOI:10.1016/j.ffa.2024.102541

Yun Fan, Yue Leng

引用次数: 0

Abstract

In this paper, we investigate the existence and asymptotic properties of self-dual 2-quasi negacyclic codes of length 2n over a finite field of cardinality q. When n is odd, we show that the q-ary self-dual 2-quasi negacyclic codes exist if and only if

q ≢ - 1 (\mod 4)

. When n is even, we prove that the q-ary self-dual 2-quasi negacyclic codes always exist. By using the technique introduced in this paper, we prove that q-ary self-dual 2-quasi negacyclic codes are asymptotically good.

查看原文

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

本刊更多论文

有限域上的自偶 2-quasi 负环码

当 n 为奇数时，我们证明了当且仅当 q≢-1(mod4)时 q-ary 自双 2-quasi 负环码存在。当 n 为偶数时，我们证明 q-ary 自双 2-quasi 负环码总是存在的。利用本文介绍的技术，我们证明了 qary 自双 2-quasi 负环码是渐近良好的。

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

求助全文

约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.

期刊最新文献

Complete description of measures corresponding to Abelian varieties over finite fields Repeated-root constacyclic codes of length kslmpn over finite fields Intersecting families of polynomials over finite fields Partial difference sets with Denniston parameters in elementary abelian p-groups Self-dual 2-quasi negacyclic codes over finite fields