Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnyi Analiz i Issledovanie Operatsii, 2019, Volume 26, Issue 4, Pages 5–15
DOI: https://doi.org/10.33048/daio.2019.26.669 (Mi da934) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Maximum intersection of linear codes and codes equivalent to linear

S. V. Avgustinovichab, E. V. Gorkunovab

a Sobolev Institute of Mathematics, 4 Acad. Koptyug Avenue, 630090 Novosibirsk, Russia
b Novosibirsk State University, 2 Pirogov Street, 630090 Novosibirsk, Russia
Full-text PDF (308 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.33048/daio.2019.26.669
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\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, MDS-code, code intersection, equivalent codes, isometry, isotopy, finite field.
Funding agency Grant number
Russian Foundation for Basic Research 19-01-00682
Siberian Branch of Russian Academy of Sciences I.5.1 (проект № 0314–2019–0016)
This research is supported by the Russian Foundation for Basic Research (Project 19–01–00682) and the Programme for Fundamental Scientific Research of SB RAS No. I.5.1 (Project 0314–2019–0016)
Received: 23.07.2019
Revised: 27.08.2019
Accepted: 28.08.2019
Document Type: Article
UDC: 519.725
Language: Russian
Citation: S. V. Avgustinovich, E. V. Gorkunov, “Maximum intersection of linear codes and codes equivalent to linear”, Diskretn. Anal. Issled. Oper., 26:4 (2019), 5–15
Citation in format AMSBIB
\Bibitem{AvgGor19}
\by S.~V.~Avgustinovich, E.~V.~Gorkunov
\paper Maximum intersection of linear codes and~codes~equivalent to~linear
\jour Diskretn. Anal. Issled. Oper.
\yr 2019
\vol 26
\issue 4
\pages 5--15
\mathnet{http://mi.mathnet.ru/da934}
\crossref{https://doi.org/10.33048/daio.2019.26.669}
Linking options:
  • https://www.mathnet.ru/eng/da934
  • https://www.mathnet.ru/eng/da/v26/i4/p5
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:346
    Full-text PDF :133
    References:31
    First page:5
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024