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., 1999, Volume 35, Issue 4, Pages 59–67 (Mi ppi461)  

This article is cited in 1 scientific paper (total in 1 paper)

Information Theory and Coding Theory

On Algebraic Decoding of Some Maximal Quaternary Codes and the Binary Golay Code

S. M. Dodunekov, V. A. Zinov'ev, J. Nilsson


Abstract: The quaternary codes devised in [Probl. Inf. Trans., 14, No. 2, 174–181 (1978)] have minimum distance $d=5$. As was shown there, they can be decoded using a standard syndrome decoding algorithm. In the present paper, we derive a simple algebraic criterion to determine the number of errors occurred and reformulate the earlier decoding algorithm described in the paper mentioned. Since a [12,6,6] quaternary code yields a cascade description of a binary extended [24,12,8] Golay code, this description provides a new method for decoding binary Golay codes.

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

English version:
Problems of Information Transmission, 1999, 35:4, 338–345

Bibliographic databases:
UDC: 621.391.15
Received: 29.07.1996
Revised: 29.06.1999

Citation: S. M. Dodunekov, V. A. Zinov'ev, J. Nilsson, “On Algebraic Decoding of Some Maximal Quaternary Codes and the Binary Golay Code”, Probl. Peredachi Inf., 35:4 (1999), 59–67; Problems Inform. Transmission, 35:4 (1999), 338–345

Citation in format AMSBIB
\Bibitem{DodZinNil99}
\by S.~M.~Dodunekov, V.~A.~Zinov'ev, J.~Nilsson
\paper On Algebraic Decoding of Some Maximal Quaternary Codes and the Binary Golay Code
\jour Probl. Peredachi Inf.
\yr 1999
\vol 35
\issue 4
\pages 59--67
\mathnet{http://mi.mathnet.ru/ppi461}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1737746}
\zmath{https://zbmath.org/?q=an:0974.94031}
\transl
\jour Problems Inform. Transmission
\yr 1999
\vol 35
\issue 4
\pages 338--345


Linking options:
  • http://mi.mathnet.ru/eng/ppi461
  • http://mi.mathnet.ru/eng/ppi/v35/i4/p59

    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

    This publication is cited in the following articles:
    1. I. M. Boyarinov, I. Martin, B. Honary, “A Class of Composite Codes with Minimum Distance 8”, Problems Inform. Transmission, 37:4 (2001), 353–364  mathnet  crossref  mathscinet  zmath
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:408
    Full text:113
    References:35
    First page:3

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