A Study on Minimal Cyclic Codes of Length Pnq

Published in Journal

Journal of Advances and Scholarly Researches in Allied Education [JASRAE] (Vol:7/ Issue: 13) DOI: 10.29070/JASRAE
Authors: Manjeet Singh*,
Subjects: Multidisciplinary Academic Research

Year: Jan, 2014
Volume: 7 / Issue: 13
Pages: 1 - 4 (4)
Publisher: Ignited Minds Journals
Source:
E-ISSN: 2230-7540
DOI:
Published URL: http://ipublisher.in/I/a/303522
Published On: Jan, 2014

Article Details

A Study on Minimal Cyclic Codes of Length pnq | Original Article

Manjeet Singh*, in Journal of Advances and Scholarly Researches in Allied Education | Multidisciplinary Academic Research

Download PDF

View PDF

ABSTRACT:

We aim at the circle R_(pn q) = GF (l)[x](x(pn q)-1), If p, q, are separate odd primes, both pn and q are a primitive root.. Explicit terminology for the entire (d+1)n+2 Early idempotents are acquired, d=gcd(ϕ(q)),p∤(q-1) Dimensions and distances created by polynomials are discussed as well as minimum cyclic length codes pnq over GF(l).