Factorisation in M'(Fq)[X]. Construction of quasi-cyclic codes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

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

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 .
Fichier principal
Vignette du fichier
122.pdf (164.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00611781 , version 1 (27-07-2011)

Identifiers

  • HAL Id : inria-00611781 , version 1

Cite

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⟩
140 View
161 Download

Share

Gmail Facebook Twitter LinkedIn More