关于可加完美码的交
On the intersection of additive perfect codes
摘要：
研究了加性（扩展和非扩展）完美码的交问题，即两个相同长度的加性码C1和C2的交中码字个数的可能性.计算交集数的上下界，对于这些界之间的任何值，构造具有该给定交集值的代码。对于所有这些代码的阿贝尔群结构的交集的特点。这个阿贝尔群结构对应的相交码的参数计算和下限和上限，这些参数的建立。最后，给出了这些界限之间的任何参数的交集都适合的码的构造。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
