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, 2012, Volume 19, Issue 4, Pages 73–85 (Mi da699)  
This article is cited in 2 scientific papers (total in 2 papers)

Affine nonsystematic codes

S. A. Malyugin

Sobolev Institute of Mathematics, Novosibirsk, Russia
Full-text PDF (284 kB) Citations (2)
References:
PDF
HTML
Abstract: A perfect binary code $C$ of length $n=2^k-1$ is called affine systematic if there exists a $k$-dimensional subspace of $\{0,1\}^n$ such that the intersection of $C$ and any coset with respect to this subspace is a singleton; otherwise $C$ is called affine nonsystematic. We describe the construction of affine nonsystematic codes. Bibliogr. 12.
Keywords: perfect code, Hamming code, nonsystematic code, affine nonsystematic code, component.
Received: 23.10.2011
English version:
Journal of Applied and Industrial Mathematics, 2012, Volume 6, Issue 4, Pages 451–459
DOI: https://doi.org/10.1134/S1990478912040060
Bibliographic databases:
Document Type: Article
UDC: 519.8
Language: Russian
Citation: S. A. Malyugin, “Affine nonsystematic codes”, Diskretn. Anal. Issled. Oper., 19:4 (2012), 73–85; J. Appl. Industr. Math., 6:4 (2012), 451–459
Citation in format AMSBIB
\Bibitem{Mal12}
\by S.~A.~Malyugin
\paper Affine nonsystematic codes
\jour Diskretn. Anal. Issled. Oper.
\yr 2012
\vol 19
\issue 4
\pages 73--85
\mathnet{http://mi.mathnet.ru/da699}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3013545}
\transl
\jour J. Appl. Industr. Math.
\yr 2012
\vol 6
\issue 4
\pages 451--459
\crossref{https://doi.org/10.1134/S1990478912040060}
Linking options:
  • https://www.mathnet.ru/eng/da699
  • https://www.mathnet.ru/eng/da/v19/i4/p73
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:315
    Full-text PDF :64
    References:55
    First page:3
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024