On the intersection of additive perfect codes

Details On the intersection of additive perfect codes On the intersection of additive perfect codes

2006-12-04

arxiv.org/abs/cs/0612015v1

Computer Science

Information Theory

Submitted to Trans. Inform. Theory

Scientific paper

The intersection problem for additive (extended and non-extended) perfect codes, i.e. which are the possibilities for the number of codewords in the intersection of two 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 codes the abelian group structure of the intersection 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, constructions of codes the intersection of which fits any parameters between these bounds are given.

Affiliated with

Also associated with

No associations

Rating

On the intersection of additive perfect codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the intersection of additive perfect codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the intersection of additive perfect codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-649458