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.
Original language | English |
---|---|
Pages (from-to) | 600-605 |
Number of pages | 6 |
Journal | Journal of Applied and Industrial Mathematics |
Volume | 13 |
Issue number | 4 |
DOIs | |
Publication status | Published - 1 Oct 2019 |
Keywords
- code intersection
- equivalent code
- finite field
- isometry
- isotopy
- linear code
- MDS-code
- pseudolinear code
OECD FOS+WOS
- 1.01 MATHEMATICS