2014/06/17 by F. E. Brochero Martínez, Martínez, F. E. Brochero
Computer Science · Mathematics · #20C05 (primary) and 16S34(secondary) #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT #msc:20C05
paper · pdf · doi:10.48550/arxiv.1406.4212
arxiv created 2014/06/17 · arxiv updated 2014/06/18
In this article, we count the quantity of minimal cyclic codes of length n and dimension k over a finite field \mathbb Fq, in the case when the prime factors of n satisfy a special condition. This problem is equivalent to count the quantity of irreducible factors of xn-1∈ \mathbb Fq[x] of degree k.