Maximum Intersection of Linear Codes and Codes Equivalent to Linear
- Autores: Avgustinovich S.V.1,2, Gorkunov E.V.1,2
-
Afiliações:
- Sobolev Institute of Mathematics
- Novosibirsk State University
- Edição: Volume 13, Nº 4 (2019)
- Páginas: 600-605
- Seção: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/213257
- DOI: https://doi.org/10.1134/S1990478919040021
- ID: 213257
Citar
Resumo
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.
Palavras-chave
Sobre autores
S. Avgustinovich
Sobolev Institute of Mathematics; Novosibirsk State University
Autor responsável pela correspondência
Email: avgust@math.nsc.ru
Rússia, pr. Akad. Koptyuga 4, Novosibirsk, 630090; ul. Pirogova 1, Novosibirsk, 630090
E. Gorkunov
Sobolev Institute of Mathematics; Novosibirsk State University
Autor responsável pela correspondência
Email: gorkunov@math.nsc.ru
Rússia, pr. Akad. Koptyuga 4, Novosibirsk, 630090; ul. Pirogova 1, Novosibirsk, 630090
Arquivos suplementares
