Self-dual 2-quasi Negacyclic Codes over Finite Fields
Yun Fan, Yue Leng

TL;DR
This paper studies the existence and properties of self-dual 2-quasi negacyclic codes over finite fields, establishing conditions for their existence and demonstrating their asymptotic goodness.
Contribution
It provides new existence criteria for self-dual 2-quasi negacyclic codes based on the parity of length and field characteristics, and proves their asymptotic goodness.
Findings
Self-dual 2-quasi negacyclic codes exist when n is even.
Existence depends on the congruence of q modulo 4 when n is odd.
These codes are proven to be asymptotically good.
Abstract
In this paper, we investigate the existence and asymptotic property of self-dual -quasi negacyclic codes of length over a finite field of cardinality . When is odd, we show that the -ary self-dual -quasi negacyclic codes exist if and only if . When is even, we prove that the -ary self-dual -quasi negacyclic codes always exist. By using the technique introduced in this paper, we prove that -ary self-dual -quasi negacyclic codes are asymptotically good.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Islamic Finance and Communication · Cooperative Communication and Network Coding
