Email this article Maximum Intersection of Linear Codes and Codes Equivalent to Linear
- Authors: Avgustinovich S.V.1,2, Gorkunov E.V.1,2
-
Affiliations:
- Sobolev Institute of Mathematics
- Novosibirsk State University
- Issue: Vol 13, No 4 (2019)
- Pages: 600-605
- Section: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/213257
- DOI: https://doi.org/10.1134/S1990478919040021
- ID: 213257
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
S. V. Avgustinovich
Sobolev Institute of Mathematics; Novosibirsk State University
Author for correspondence.
Email: avgust@math.nsc.ru
Russian Federation, pr. Akad. Koptyuga 4, Novosibirsk, 630090; ul. Pirogova 1, Novosibirsk, 630090
E. V. Gorkunov
Sobolev Institute of Mathematics; Novosibirsk State University
Author for correspondence.
Email: gorkunov@math.nsc.ru
Russian Federation, pr. Akad. Koptyuga 4, Novosibirsk, 630090; ul. Pirogova 1, Novosibirsk, 630090
