Geodesic
Maximum intersection of linear codes and~codes~equivalent to~linear
Diskretnyj analiz i issledovanie operacij, Tome 26 (2019) no. 4, pp. 5-15

Voir la notice de l'article provenant de la source Math-Net.Ru

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\geqslant 3$ for the size of the intersection of two different pseudolinear codes of the same size $M$. Bibliogr. 10.
Keywords: linear code, pseudolinear code, code intersection, isometry, isotopy, finite field.
Mots-clés : MDS-code, equivalent codes 
@article{DA_2019_26_4_a0,
     author = {S. V. Avgustinovich and E. V. Gorkunov},
     title = {Maximum intersection of linear codes and~codes~equivalent to~linear},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {5--15},
     publisher = {mathdoc},
     volume = {26},
     number = {4},
     year = {2019},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2019_26_4_a0/}
}
TY  - JOUR
AU  - S. V. Avgustinovich
AU  - E. V. Gorkunov
TI  - Maximum intersection of linear codes and~codes~equivalent to~linear
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2019
SP  - 5
EP  - 15
VL  - 26
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2019_26_4_a0/
LA  - ru
ID  - DA_2019_26_4_a0
ER  - 
%0 Journal Article
%A S. V. Avgustinovich
%A E. V. Gorkunov
%T Maximum intersection of linear codes and~codes~equivalent to~linear
%J Diskretnyj analiz i issledovanie operacij
%D 2019
%P 5-15
%V 26
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2019_26_4_a0/
%G ru
%F DA_2019_26_4_a0
S. V. Avgustinovich; E. V. Gorkunov. Maximum intersection of linear codes and~codes~equivalent to~linear. Diskretnyj analiz i issledovanie operacij, Tome 26 (2019) no. 4, pp. 5-15. http://geodesic.mathdoc.fr/item/DA_2019_26_4_a0/