RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find






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


Probl. Peredachi Inf., 2004, Volume 40, Issue 1, Pages 40–47 (Mi ppi122)  

This article is cited in 8 scientific papers (total in 8 papers)

Coding Theory

Constructing Perfect $q$-ary Codes by Sequential Switchings of $\tilde\alpha$-Components

A. V. Los'

Novosibirsk State University

Abstract: We suggest a construction of perfect $q$-ary codes using sequential switchings of special-type components of the Hamming code. The construction yields a lower bound on the number of different $q$-ary codes.

Full text: PDF file (842 kB)
References: PDF file   HTML file

English version:
Problems of Information Transmission, 2004, 40:1, 37–43

Bibliographic databases:

UDC: 621.391.15
Received: 25.06.2003
Revised: 15.10.2003

Citation: A. V. Los', “Constructing Perfect $q$-ary Codes by Sequential Switchings of $\tilde\alpha$-Components”, Probl. Peredachi Inf., 40:1 (2004), 40–47; Problems Inform. Transmission, 40:1 (2004), 37–43

Citation in format AMSBIB
\Bibitem{Los04}
\by A.~V.~Los'
\paper Constructing Perfect $q$-ary Codes by Sequential Switchings of $\tilde\alpha$-Components
\jour Probl. Peredachi Inf.
\yr 2004
\vol 40
\issue 1
\pages 40--47
\mathnet{http://mi.mathnet.ru/ppi122}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2099018}
\zmath{https://zbmath.org/?q=an:1085.94022}
\transl
\jour Problems Inform. Transmission
\yr 2004
\vol 40
\issue 1
\pages 37--43
\crossref{https://doi.org/10.1023/B:PRIT.0000024878.62847.42}


Linking options:
  • http://mi.mathnet.ru/eng/ppi122
  • http://mi.mathnet.ru/eng/ppi/v40/i1/p40

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
    Erratum

    This publication is cited in the following articles:
    1. A. M. Romanov, “O razbieniyakh $q$-ichnykh kodov Khemminga na neperesekayuschiesya komponenty”, Diskretn. analiz i issled. oper., ser. 1, ser. 1, 11:3 (2004), 80–87  mathnet  mathscinet  zmath
    2. A. V. Los', “Construction of Perfect $q$-ary Codes by Switchings of Simple Components”, Problems Inform. Transmission, 42:1 (2006), 30–37  mathnet  crossref  mathscinet  zmath
    3. Solov'eva F.I., “On perfect binary codes”, Discrete Appl. Math., 156:9 (2008), 1488–1498  crossref  mathscinet  zmath  isi
    4. S. A. Malyugin, “On nonsystematic perfect codes over finite fields”, J. Appl. Industr. Math., 4:2 (2010), 218–230  mathnet  crossref  mathscinet  zmath
    5. E. V. Gorkunov, “Monomialnye avtomorfizmy lineinoi i prostoi komponent koda Khemminga”, Diskretn. analiz i issled. oper., 17:1 (2010), 11–33  mathnet  mathscinet  zmath
    6. A. V. Los, F. I. Soloveva, “O razbieniyakh prostranstva $F^N_q$ na affinno neekvivalentnye sovershennye $q$-znachnye kody”, Sib. elektron. matem. izv., 7 (2010), 425–434  mathnet
    7. Ostergard P.R.J., “Switching codes and designs”, Discrete Math, 312:3 (2012), 621–632  crossref  mathscinet  zmath  isi  elib
    8. S. A. Malyugin, “Sistematicheskie i nesistematicheskie sovershennye kody beskonechnoi dliny nad konechnymi polyami”, Sib. elektron. matem. izv., 16 (2019), 1732–1751  mathnet  crossref
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:324
    Full text:85
    References:27

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020