Maximum Intersection of Linear Codes and Codes Equivalent to Linear

S. V. Avgustinovich, E. V. Gorkunov

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)600-605
Number of pages6
JournalJournal of Applied and Industrial Mathematics
Volume13
Issue number4
DOIs
Publication statusPublished - 1 Oct 2019

Keywords

  • code intersection
  • equivalent code
  • finite field
  • isometry
  • isotopy
  • linear code
  • MDS-code
  • pseudolinear code

Fingerprint Dive into the research topics of 'Maximum Intersection of Linear Codes and Codes Equivalent to Linear'. Together they form a unique fingerprint.

Cite this