On the intersection of ℤ24-Additive perfect codes

Josep Rifà*, Faina Ivanovna Solov'eva, Mercè Villanueva

*Autor corresponent d’aquest treball

Producció científica: Contribució a revistaArticleRecercaAvaluat per experts

10 Cites (Scopus)

Resum

The intersection problem for ℤ24 -additive (extended and nonextended) perfect codes, i.e., which are the possibilities for the number of codewords in the intersection of two ℤ24-additive codes C1 and C2 of the same length, is investigated. Lower and upper bounds for the intersection number are computed and, for any value between these bounds, codes which have this given intersection value are constructed. For all these ℤ24-additive codes C1 and C2, the abelian group structure of the intersection codes C1 ∩ C2 is characterized. The parameters of this abelian group structure corresponding to the intersection codes are computed and lower and upper bounds for these parameters are established. Finally, for all possible parameters between these bounds, constructions of codes with these parameters for their intersections are given.

Idioma originalAnglès
Pàgines (de-a)1346-1356
Nombre de pàgines11
RevistaIEEE Transactions on Information Theory
Volum54
Número3
DOIs
Estat de la publicacióPublicada - de març 2008

Fingerprint

Navegar pels temes de recerca de 'On the intersection of ℤ24-Additive perfect codes'. Junts formen un fingerprint únic.

Com citar-ho