Maximum Intersection of Linear Codes and Codes Equivalent to Linear
- 作者: Avgustinovich S.1,2, Gorkunov E.1,2
-
隶属关系:
- Sobolev Institute of Mathematics
- Novosibirsk State University
- 期: 卷 13, 编号 4 (2019)
- 页面: 600-605
- 栏目: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/213257
- DOI: https://doi.org/10.1134/S1990478919040021
- ID: 213257
如何引用文章
详细
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.
作者简介
S. Avgustinovich
Sobolev Institute of Mathematics; Novosibirsk State University
编辑信件的主要联系方式.
Email: avgust@math.nsc.ru
俄罗斯联邦, pr. Akad. Koptyuga 4, Novosibirsk, 630090; ul. Pirogova 1, Novosibirsk, 630090
E. Gorkunov
Sobolev Institute of Mathematics; Novosibirsk State University
编辑信件的主要联系方式.
Email: gorkunov@math.nsc.ru
俄罗斯联邦, pr. Akad. Koptyuga 4, Novosibirsk, 630090; ul. Pirogova 1, Novosibirsk, 630090