We consider linear codes in a space over a finite field with the Hamming metric. A code is called pseudolinear if it is the image of a linear code under an isometric transformation of the space. We derive an upper bound (q - 2)M/q attainable for q ⩾ 3 for the size of the intersection of two different pseudolinear codes of the same size M.

中文翻译：

---

线性码与线性码的最大交集

我们考虑使用汉明度量的有限域上的空间中的线性代码。如果代码是空间等距变换下的线性代码的图像，则该代码称为伪线性。我们推导出上限（Q - 2）M / Q可达到对q ⩾3的相同大小的两个不同的伪线性码的交集的大小M.