Browsing by Author "Kivunge, Benard"

Now showing 1 - 2 of 2
  • No Thumbnail Available
    Item
    Enumeration of cyclic codes over GF(17)
    (UoEm, 2015-05) Hussein, Lao; Kivunge, Benard; Muthoka, Geoffrey; Mwangi, Patrick
    In this paper we seek the number of irreducible polynomials of xn− 1 over GF(17). We factorize Xn− 1 over GF(17)into irreducible polynomials using cyclotomic cosets of 17 modulo n . The number of irreducible polynomials factors of Xn− 1 over fq is equal to the number of q cyclotomic cosets of modulo n. Each monic divisor of Xn− 1 is a generator polynomial of cyclic code in Fqn. We show that the number of cyclic codes of length n over a finite field f is equal to Xn− 1. Lastly, the number of cyclic codes of length n , when n= 17 , = the number of polynomials that divide 17k ,n = 17k,n=17k − 1, ( , 17) = 1 are enumerated.
  • No Thumbnail Available
    Item
    On the Number of Cyclotomic Cosets and Cyclic Codes over Z13
    (UoEm, 2018-06) Hussein, Lao; Kivunge, Benard; Kimani, Patrick; Muthoka, Geoffrey
    Let Zq be a finite field with q element and x n − 1 be a given cyclotomic polynomial. The number of cyclotomic cosets and cyclic codes has not been done in general. Although for different values of q the polynomial x n − 1 has been characterised. This paper will determine the number of irreducible monic polynomials and cyclotomic cosets of x n − 1 over Z13 .The factorization of x n − 1 over Z13 into irreducible polynomials using cyclotomic cosets of 13 modulo n will be established. The number of irreducible polynomials factors of x n − 1 over Zq is equal to the number of cyclotomic cosets of q modulo n. Each monic divisor of x n − 1 is a generator polynomial of cyclic code in Fq n . This paper will further show that the number of cyclic codes of length n over a finite field F is equal to the number of polynomials that divide x n − 1. Finally, the number of cyclic codes of length n, when n = 13k, n = 13k , n = 13k − 1, k, 13 = 1 are determine.