New generalized sub class of cyclic-Goppa code

Author(s):  
Rajesh Kumar Narula ◽  
O. P. Vinocha ◽  
Ajay Kumar
Keyword(s):  
2014 ◽  
Vol 2014 ◽  
pp. 1-4 ◽  
Author(s):  
Kondwani Magamba ◽  
John A. Ryan

The problem of finding the number of irreducible monic polynomials of degree r over Fqn is considered in this paper. By considering the fact that an irreducible polynomial of degree r over Fqn has a root in a subfield Fqs of Fqnr if and only if (nr/s,r)=1, we show that Gauss’s formula for the number of monic irreducible polynomials can be derived by merely considering the lattice of subfields of Fqnr . We also use the lattice of subfields of Fqnr to determine if it is possible to generate a Goppa code using an element lying in a proper subfield of Fqnr.


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.


SciVee ◽  
2009 ◽  
Author(s):  
Nathan Ilten ◽  
Nathan Ilten
Keyword(s):  

2013 ◽  
Vol 59 (10) ◽  
pp. 6628-6641 ◽  
Author(s):  
Jose Ignacio Iglesias Curto ◽  
Angel Luis Munoz Castaneda ◽  
Jose Maria Munoz Porras ◽  
Gloria Serrano Sotelo

1984 ◽  
Vol 30 (5) ◽  
pp. 773-773 ◽  
Author(s):  
M. Loeloeian ◽  
J. Conan
Keyword(s):  

1991 ◽  
Vol 37 (5) ◽  
pp. 1432-1433 ◽  
Author(s):  
H.T. Cao ◽  
R.L. Dougherty ◽  
H. Janwa

Sign in / Sign up

Export Citation Format

Share Document