Intersection of Isomorphic Linear Codes |
| |
Authors: | Eli Bar-Yahalom Tuvi Etzion |
| |
Institution: | Department of Computer Science, Technion—Israel Institute of Technology, Haifa, 32000, Israel |
| |
Abstract: | Given an (n, k) linear code
over GF(q), the intersection of
with a codeπ(
), whereπSn, is an (n, k1) code, where max{0, 2k−n}k1k. The intersection problem is to determine which integers in this range are attainable for a given code
. We show that, depending on the structure of the generator matrix of the code, some of the values in this range are attainable. As a consequence we give a complete solution to the intersection problem for most of the interesting linear codes, e.g. cyclic codes, Reed–Muller codes, and most MDS codes. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|