Maximum intersection of linear codes and codes equivalent to linear Full article
| Journal |
Journal of Applied and Industrial Mathematics
ISSN: 1990-4789 , E-ISSN: 1990-4797 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2019, Volume: 13, Number: 4, Pages: 600-605 Pages count : 6 DOI: 10.1134/s1990478919040021 | ||||
| Tags | linear code, pseudolinear code, MDS-code, code intersection, equivalent code, isometry, isotopy, finite field | ||||
| Authors |
|
||||
| Affiliations |
|
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.
Cite:
Avgustinovich S.V.
, Gorkunov E.V.
Maximum intersection of linear codes and codes equivalent to linear
Journal of Applied and Industrial Mathematics. 2019. V.13. N4. P.600-605. DOI: 10.1134/s1990478919040021 Scopus РИНЦ OpenAlex
Maximum intersection of linear codes and codes equivalent to linear
Journal of Applied and Industrial Mathematics. 2019. V.13. N4. P.600-605. DOI: 10.1134/s1990478919040021 Scopus РИНЦ OpenAlex
Original:
Августинович С.В.
, Горкунов Е.В.
Максимальное пересечение линейных и эквивалентных им кодов
Сибирский журнал индустриальной математики. 2019. Т.26. №4. С.5-15. DOI: 10.33048/daio.2019.26.669 РИНЦ OpenAlex
Максимальное пересечение линейных и эквивалентных им кодов
Сибирский журнал индустриальной математики. 2019. Т.26. №4. С.5-15. DOI: 10.33048/daio.2019.26.669 РИНЦ OpenAlex
Dates:
| Submitted: | Jul 23, 2019 |
| Accepted: | Aug 28, 2019 |
| Published online: | Feb 4, 2020 |
Identifiers:
| Scopus: | 2-s2.0-85078933345 |
| Elibrary: | 43236392 |
| OpenAlex: | W2999794859 |