By Topic

On the Intersection of  {BBZ }_{2} {BBZ }_{4} -Additive Perfect Codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Rifa, J. ; Dept. of Inf. & Commun. Eng., Univ. Autonoma de Barcelona, Barcelona ; Solov'eva, F.I. ; Villanueva, M.

The intersection problem for Z2Z4-additive (extended and nonextended) perfect codes, i.e., which are the possibilities for the number of codewords in the intersection of two Z2Z4-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 Z2Z4-additive codes C1 and C2, the abelian group structure of the intersection codes C1 cap 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.

Published in:

Information Theory, IEEE Transactions on  (Volume:54 ,  Issue: 3 )