Doklady Akademii Nauk
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Dokl. Akad. Nauk:
Year:
Volume:
Issue:
Page:
Find




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

Doklady Akademii Nauk, 1993, Volume 330, Number 1, Pages 20–23 (Mi dan5207)  
MATHEMATICS

Decoding the Reed–Solomon code when the number of errors is greater than half of the code distance

V. M. Sidel'nikov

Lomonosov Moscow State University
Full-text PDF (321 kB)
Presented: Yu. V. Prokhorov
Received: 23.10.1992
Bibliographic databases:
Document Type: Article
UDC: 519.1+519.4
Language: Russian
Citation: V. M. Sidel'nikov, “Decoding the Reed–Solomon code when the number of errors is greater than half of the code distance”, Dokl. Akad. Nauk, 330:1 (1993), 20–23; Dokl. Math., 47:3 (1993), 378–382
Citation in format AMSBIB
\Bibitem{Sid93}
\by V.~M.~Sidel'nikov
\paper Decoding the Reed--Solomon code when the number of errors is greater than half of the code distance
\jour Dokl. Akad. Nauk
\yr 1993
\vol 330
\issue 1
\pages 20--23
\mathnet{http://mi.mathnet.ru/dan5207}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1234347}
\zmath{https://zbmath.org/?q=an:0820.94022}
\transl
\jour Dokl. Math.
\yr 1993
\vol 47
\issue 3
\pages 378--382
Linking options:
  • https://www.mathnet.ru/eng/dan5207
  • https://www.mathnet.ru/eng/dan/v330/i1/p20
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:98
    Full-text PDF :23
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024