The weight distributions of irreducible cyclic codes of length 2npm

2018 ◽  
Vol 11 (06) ◽  
pp. 1850085
Author(s):  
Monika Sangwan ◽  
Pankaj Kumar

Let [Formula: see text] be a primitive root modulo [Formula: see text], where [Formula: see text] and [Formula: see text] are distinct odd primes. Let [Formula: see text] be a finite field. For such pair of [Formula: see text] and [Formula: see text], the explicit expressions of minimal and generating polynomials over [Formula: see text] are obtained for all irreducible cyclic codes of length [Formula: see text]. In Sec. 4, it is observed that the weight distributions of all irreducible cyclic codes of length [Formula: see text] over [Formula: see text] can be computed easily with the help of the results obtained in [P. Kumar, M. Sangwan and S. K. Arora, The weight distribution of some irreducible cyclic codes of length [Formula: see text] and [Formula: see text], Adv. Math. Commun. 9 (2015) 277–289]. An explicit formula is also given to compute the weight distributions of irreducible cyclic codes of length [Formula: see text] over [Formula: see text].

2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Yuqian Lin ◽  
Qin Yue ◽  
Yansheng Wu

Let Fq be a finite field with q elements and n a positive integer. In this paper, we use matrix method to give all primitive idempotents of irreducible cyclic codes of length n, whose prime divisors divide q-1.


2011 ◽  
Vol 41 (10) ◽  
pp. 877-884
Author(s):  
LiWei ZENG ◽  
Yang LIU ◽  
ChangLi MA

1977 ◽  
Vol 18 (2) ◽  
pp. 179-211 ◽  
Author(s):  
Tor Helleseth ◽  
Torleiv KlØve ◽  
Johannes Mykkeltveit

Author(s):  
Rong Wang ◽  
Xiaoni Du ◽  
Cuiling Fan ◽  
Zhihua Niu

Due to their important applications to coding theory, cryptography, communications and statistics, combinatorial [Formula: see text]-designs have attracted lots of research interest for decades. The interplay between coding theory and [Formula: see text]-designs started many years ago. It is generally known that [Formula: see text]-designs can be used to derive linear codes over any finite field, and that the supports of all codewords with a fixed weight in a code also may hold a [Formula: see text]-design. In this paper, we first construct a class of linear codes from cyclic codes related to Dembowski-Ostrom functions. By using exponential sums, we then determine the weight distribution of the linear codes. Finally, we obtain infinite families of [Formula: see text]-designs from the supports of all codewords with a fixed weight in these codes. Furthermore, the parameters of [Formula: see text]-designs are calculated explicitly.


2007 ◽  
Vol 06 (03) ◽  
pp. 403-414 ◽  
Author(s):  
MASSIMILIANO SALA

Using Gröbner techniques, we can exhibit a method to get the distance and weight distribution of cyclic codes and shortened cyclic codes, improving earlier similar results for the distance of cyclic codes.


2012 ◽  
Vol 18 (1) ◽  
pp. 144-159 ◽  
Author(s):  
Anuradha Sharma ◽  
Gurmeet K. Bakshi

Author(s):  
Yang Liu ◽  
Yang Zhang ◽  
Zisen Kong

In this paper, the weight distribution of the irreducible cyclic codes over [Formula: see text] with length [Formula: see text] and dimension [Formula: see text] is settled for a few special cases. These irreducible cyclic codes have two weights or three weights or four weights.


2007 ◽  
Vol 13 (4) ◽  
pp. 1086-1095 ◽  
Author(s):  
Anuradha Sharma ◽  
Gurmeet K. Bakshi ◽  
Madhu Raka

Sign in / Sign up

Export Citation Format

Share Document