Advertisement
Published in:
01-06-2015 | Original Research
Minimal cyclic codes of length \(8p^{n}\) over \(GF(q)\), where \(q\) is prime power of the form \(8k+5\)
Published in: Journal of Applied Mathematics and Computing | Issue 1-2/2015
Log inActivate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
The explicit expression for the \(8n+6\) primitive idempotents in \(FG\) (the group algebra of the cyclic group \(G\) of order \(8p^{n}\), where \(p\) is an odd prime, \(n\ge 1)\) over the finite field \(F\) of prime power order \(q\), where \(q\) is of the form \(8k+5\) and is a primitive root modulo \(p^{n}\) are obtained. The minimum distances, dimensions and the generating polynomials of the minimal cyclic codes generated by these primitive idempotents are also obtained.