The weights of the orthogonals of certain cyclic codes or extended GOPPA codes

Author(s):  
J. Wolfmann
Keyword(s):  
2016 ◽  
Vol 15 (5) ◽  
pp. 6776-6784
Author(s):  
Ajay Sharma ◽  
O. P. VINOCHA
Keyword(s):  

In 2013[4]a new subclass of cyclic Goppa code with Goppa polynomial of degree 2 is presented by Bezzateev and Shekhunova. They proved that this subclass contains all cyclic codes of considered length. In the present work we consider a Goppa polynomial of degree three and proved that the subclass generated by this polynomial represent a cyclic, reversible and separable Goppa code.


2012 ◽  
Vol 04 (04) ◽  
pp. 1250059 ◽  
Author(s):  
TARIQ SHAH ◽  
ANTONIO APARECIDO DE ANDRADE

Let B[X; S] be a monoid ring with any fixed finite unitary commutative ring B and [Formula: see text] is the monoid S such that b = a + 1, where a is any positive integer. In this paper we constructed cyclic codes, BCH codes, alternant codes, Goppa codes, Srivastava codes through monoid ring [Formula: see text]. For a = 1, almost all the results contained in [16] stands as a very particular case of this study.


1975 ◽  
Vol 21 (6) ◽  
pp. 712-716 ◽  
Author(s):  
K. Tzeng ◽  
K. Zimmermann
Keyword(s):  

Author(s):  
Zhengchun ZHOU ◽  
Xiaohu TANG ◽  
Udaya PARAMPALLI
Keyword(s):  

Author(s):  
Wenhua ZHANG ◽  
Shidong ZHANG ◽  
Yong WANG ◽  
Jianpeng WANG

Filomat ◽  
2019 ◽  
Vol 33 (8) ◽  
pp. 2237-2248 ◽  
Author(s):  
Habibul Islam ◽  
Om Prakash

In this paper, we study (1 + 2u + 2v)-constacyclic and skew (1 + 2u + 2v)-constacyclic codes over the ring Z4 + uZ4 + vZ4 + uvZ4 where u2 = v2 = 0,uv = vu. We define some new Gray maps and show that the Gray images of (1 + 2u + 2v)-constacyclic and skew (1 + 2u + 2v)-constacyclic codes are cyclic, quasi-cyclic and permutation equivalent to quasi-cyclic codes over Z4. Further, we determine the structure of (1 + 2u + 2v)-constacyclic codes of odd length n.


2017 ◽  
Vol 15 (1) ◽  
pp. 1099-1107 ◽  
Author(s):  
María Isabel García-Planas ◽  
Maria Dolors Magret ◽  
Laurence Emilie Um

Abstract It is well known that cyclic codes are very useful because of their applications, since they are not computationally expensive and encoding can be easily implemented. The relationship between cyclic codes and invariant subspaces is also well known. In this paper a generalization of this relationship is presented between monomial codes over a finite field 𝔽 and hyperinvariant subspaces of 𝔽n under an appropriate linear transformation. Using techniques of Linear Algebra it is possible to deduce certain properties for this particular type of codes, generalizing known results on cyclic codes.


Sign in / Sign up

Export Citation Format

Share Document