A class of p-ary cyclic codes and their weight enumerators
نویسندگان
چکیده
Let m, k be positive integers such that m gcd(m,k) ≥ 3, p be an odd prime and π be a primitive element of Fpm. Let h1(x) and h2(x) be the minimal polynomials of −π−1 and π pk+1 2 over Fp, respectively. In the case of odd m gcd(m,k) , when k is even, gcd(m,k) is odd or when k gcd(m,k) is odd, Zhou et al. in [25] obtained the weight distribution of a class of cyclic codes C over Fp with parity-check polynomial h1(x)h2(x). In this paper, we further investigate this class of cyclic codes C over Fp in the rest case of odd m gcd(m,k) and the case of even m gcd(m,k) . Moreover, we determine the weight distribution of cyclic codes C.
منابع مشابه
On Weight Distributions of Homogeneous Metric Spaces Over GF (p) and MacWilliams Identity
We introduce in this paper the notion homogeneous metric space on the Galois field GF (p) , where p is a prime natural number. We show that homogeneous weight enumerators of some linear codes over GF (p) are Hamming weight enumerators of some of their p-ary images. It is also proved that in some cases, the MacWilliams Identity holds for homogeneous metric spaces.
متن کاملThe weight distributions of two classes of p-ary cyclic codes with few weights
Cyclic codes have attracted a lot of research interest for decades as they have efficient encoding and decoding algorithms. In this paper, for an odd prime p, the weight distributions of two classes of p-ary cyclic codes are completely determined. We show that both codes have at most five nonzero weights.
متن کاملComplete weight enumerators of a family of three-weight linear codes
Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime p, we present the explicit complete weight enumerator of a family of p-ary linear codes constructed with defining set. The weight enumerator is an immediate result of the complete weight enumerator which shows that the codes proposed in this paper are three-weight linear codes...
متن کاملA class of q-ary linear codes derived from irreducible cyclic codes
Recently, linear codes with a few weights were widely investigated due to their applications in secret sharing schemes and authentication schemes. In this letter, we present a class of q-ary linear codes derived from irreducible cyclic codes with q a prime power. We use Gauss sums to represent its Hamming weights and obtain the bounds of its minimum Hamming distance. In some cases, we explicitl...
متن کاملA theorem on the quantum evaluation of Weight Enumerators for a certain class of Cyclic Codes with a note on Cyclotomic cosets
This note is a stripped down version of a published paper on the Potts partition function, where we concentrate solely on the linear coding aspect of our approach. It is meant as a resource for people interested in coding theory but who do not know much of the mathematics involved and how quantum computation may provide a speed up in the computation of a very important quantity in coding theory...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Adv. in Math. of Comm.
دوره 10 شماره
صفحات -
تاریخ انتشار 2016