Skip to Main content Skip to Navigation
Conference papers

Factorisation in M'(Fq)[X]. Construction of quasi-cyclic codes

Christophe Chabot 1 
Abstract : Quasi-cyclic codes are viewed as codes cancelled by polynomials with matricial coefficients. This construction leads to the problem of factorisation of Xm -1 in M'(Fq)[X]. In this paper we deal with the general factorisation in M'(Fq)[X]. Then we give results on the roots and the factorisation of the particular polynomial Xm -1. These factorisations permit the construction of such quasi-cyclic codes. We show that in most cases, these codes meet best known bounds for minimum distances. We even found two new codes with parameters better than known [30; 22; 6]F4 and [29; 21; 6]F4 .
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Assia Saadi Connect in order to contact the contributor
Submitted on : Wednesday, July 27, 2011 - 2:30:53 PM
Last modification on : Tuesday, October 19, 2021 - 11:13:13 PM
Long-term archiving on: : Monday, November 12, 2012 - 2:40:24 PM


Files produced by the author(s)


  • HAL Id : inria-00611781, version 1



Christophe Chabot. Factorisation in M'(Fq)[X]. Construction of quasi-cyclic codes. WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.209-218. ⟨inria-00611781⟩



Record views


Files downloads