On the intersection of Z2Z4-additive perfect codes

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

Research output: Contribution to journalArticleResearchpeer-review

4 Citations (Scopus)


The intersection problem for ℤ2ℤ4 -additive (extended and nonextended) perfect codes, i.e., which are the possibilities for the number of codewords in the intersection of two ℤ2ℤ4-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 ℤ2ℤ4-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. © 2008 IEEE.
Original languageEnglish
Pages (from-to)1346-1356
JournalIEEE Transactions on Information Theory
Publication statusPublished - 1 Mar 2008


  • Additive codes
  • Extended perfect codes
  • Intersection
  • Perfect codes

Fingerprint Dive into the research topics of 'On the intersection of Z2Z4-additive perfect codes'. Together they form a unique fingerprint.

Cite this