Construction of New Completely Regular Z2Z4-linear Codes from Old - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Construction of New Completely Regular Z2Z4-linear Codes from Old

Résumé

A code C is said to be Z2Z4-additive if its coordinates can be partitioned into two subsets X and Y , in such a way that the punctured code of C obtained by removing the coordinates outside X (or, respec- tively, Y ) is a binary linear code (respectively, a quaternary linear code). The binary image of a Z2Z4-additive code, through the Gray map, is a Z2Z4-linear code, which is not always linear. Given a perfect Z2Z4-linear code, which is known to be completely regular, some constructions yield- ing new Z2Z4-linear codes are computed, and the completely regularity of the obtained codes is studied.
Fichier principal
Vignette du fichier
77.pdf (126.53 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00607336 , version 1 (08-07-2011)

Identifiants

  • HAL Id : inria-00607336 , version 1

Citer

Josep Rifa, Lorena Ronquillo. Construction of New Completely Regular Z2Z4-linear Codes from Old. WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.71-80. ⟨inria-00607336⟩

Collections

WCC2011 TDS-MACS
122 Consultations
112 Téléchargements

Partager

Gmail Facebook X LinkedIn More