Problemy Peredachi Informatsii
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



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






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


Problemy Peredachi Informatsii, 1972, Volume 8, Issue 3, Pages 21–26 (Mi ppi850)  

Coding Theory

Majority Decoding of Linear Codes

G. K. Kladov
Abstract: An $M$-decoding procedure is described, which generalizes the conventional one-step majority-decoding procedures. It is shown that any linear code correcting an error set closed under multiplication by elements of the basic field can be $M$-decoded. In particular, all binary linear codes can be $M$-decoded.
Received: 13.03.1971
Bibliographic databases:
Document Type: Article
UDC: 621.391.156
Language: Russian
Citation: G. K. Kladov, “Majority Decoding of Linear Codes”, Probl. Peredachi Inf., 8:3 (1972), 21–26; Problems Inform. Transmission, 8:3 (1972), 194–198
Citation in format AMSBIB
\Bibitem{Kla72}
\by G.~K.~Kladov
\paper Majority Decoding of Linear Codes
\jour Probl. Peredachi Inf.
\yr 1972
\vol 8
\issue 3
\pages 21--26
\mathnet{http://mi.mathnet.ru/ppi850}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=327379}
\zmath{https://zbmath.org/?q=an:0286.94012}
\transl
\jour Problems Inform. Transmission
\yr 1972
\vol 8
\issue 3
\pages 194--198
Linking options:
  • https://www.mathnet.ru/eng/ppi850
  • https://www.mathnet.ru/eng/ppi/v8/i3/p21
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Проблемы передачи информации Problems of Information Transmission
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024