Two families of negacyclic BCH codes
نویسندگان
چکیده
Negacyclic BCH codes are a subclass of neagcyclic and the best linear in many cases. However, there have been very few results on negacyclic codes. Let q be an odd prime power m positive integer. The objective this paper is to study with length $$\frac{q^m-1}{2}$$ $$\frac{q^m+1}{2}$$ over finite field $${\textrm{GF}}(q)$$ analyse their parameters. presented good parameters general, contain optimal For certain m, compared cyclic same dimension length, larger minimum distance some
منابع مشابه
Constructions of new families of nonbinary asymmetric quantum BCH codes and subsystem BCH codes
Two code constructions generating new families of good nonbinary asymmetric quantum BCH codes and good nonbinary subsystem BCH codes are presented in this paper. The first one is derived from q-ary Steane’s enlargement of CSS codes applied to nonnarrow-sense BCH codes. The second one is derived from the method of defining sets of classical cyclic codes. The asymmetric quantum BCH codes and subs...
متن کاملNew Families of Triple Error Correcting Codes with BCH Parameters
Discovered by Bose, Chaudhuri and Hocquenghem [1], [4], the BCH family of error correcting codes are one of the most studied families in coding theory. They are also among the best performing codes, particularly when the number of errors being corrected is small relative to the code length. In this article we consider binary codes with minimum distance of 7. We construct new families of codes w...
متن کاملOn MDS Negacyclic LCD Codes
This paper is devoted to the study of linear codes with complementary-duals (LCD) arising from negacyclic codes over finite fields Fq, where q is an odd prime power. We obtain two classes of MDS negacyclic LCD codes of length n| q−1 2 , n| q+1 2 and a class of negacyclic LCD codes of length n = q+1. Also, we drive some parameters of Hermitian negacyclic LCD codes over Fq2 of length n = q − 1 an...
متن کاملOn Negacyclic MDS-Convolutional Codes
New families of classical and quantum optimal negacyclic convolutional codes are constructed in this paper. This optimality is in the sense that they attain the classical (quantum) generalized Singleton bound. The constructions presented in this paper are performed algebraically and not by computational search.
متن کاملNegacyclic codes over Z4+uZ4
In this paper, we study negacyclic codes of odd length and of length 2k over the ring R = Z4 + uZ4, u2 = 0. We give the complete structure of negacyclic codes for both the cases. We have obtained a minimal spanning set for negacyclic codes of odd lengths over R. A necessary and sufficient condition for negacyclic codes of odd lengths to be free is presented. We have determined the cardinality o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2023
ISSN: ['0925-1022', '1573-7586']
DOI: https://doi.org/10.1007/s10623-023-01208-6