ISSN 2234-8417 (Online) ISSN 1598-5857 (Print)

Table of Contents
2014's   32,3-4(May)
  A New Class of Cyclic Codes using Ordered Power Product of Polynomials
    By Ankita Gaur ..........1528
Generic Number - 1528
References - 0
Written Date - May 16th, 14
Modified Date - May 16th, 14
Downloaded Counts - 2009
Visited Counts - 1334
Original File
The paper introduces a new product of polynomials defined over a field. It is a
generalization of the ordinary product with inner polynomial getting non-overlapping
segments obtained by multiplying with coefficients and variable with expanding
powers. It has been called \textquoteleft{}Ordered Power Product\textquoteright{}
(OPP). Considering two rings of polynomials $R_{m}\left[x\right]=F\left[x\right]
$ modulo$x^{m}-1$ and $R_{n}\left[x\right]=F\left[x\right]$modulo$x^{n}-1$ ,
over a field F, the paper then considers the newly introduced product of the two
polynomial rings. Properties and algebraic structure of the product of two rings of
polynomials are studied and it is shown to be a ring. Using the new type of product
of polynomials, we define a new product of two cyclic codes and devise a method
of getting a cyclic code from the \textquoteleft{}ordered power
product\textquoteright{} of two cyclic codes. Conditions for the OPP of the
generators polynomials of component codes, giving a cyclic code are examined. It is
shown that OPP cyclic code so obtained is more efficient than the one that can be
obtained by Kronecker type of product of the same component codes.

학회 : 정보전산응용수학회(KSICAM) (구: KSCAM & Korean SIGCAM)
연구소 : SPCHIN 전산응용수학연구소 ( SPCHIN-CAM Institute : SPCHIN-CAMI)
Copyright ⓒ 2021 JAMC, JAMI. All rights reserved.  E-mail :
Main Office : c/o Springer Tiergartenstrasse 17 D-69121 Heidelberg, GERMANY.