Uchenyye zapiski UlGU. Seriya "Matematika i informatsionnyye tekhnologii"
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


Uchenyye zapiski UlGU. Seriya "Matematika i informatsionnyye tekhnologii":
Year:
Volume:
Issue:
Page:
Find




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

Uchenyye zapiski UlGU. Seriya "Matematika i informatsionnyye tekhnologii", 2021, Issue 1, Pages 87–101 (Mi ulsu42)  
On decoding algorithms of cyclic codes

S. M. Ratseev, A. M. Ivantsov, P. A. Buldakovsky

Ulyanovsk State University, Ulyanovsk, Russia
Full-text PDF (401 kB)
References:
PDF
HTML
Abstract: Cyclic codes are widely used in noise-resistant coding. These codes are used to detect and/or correct errors. Among the cyclic codes, Reed-Solomon codes stand out. This article considers some simple decoding algorithms for cyclic codes and Reed–Solomon codes.
Keywords: cyclic codes, code decoding, Reed–Solomon codes.
Received: 18.04.2021
Revised: 18.04.2021
Accepted: 31.05.2021
Document Type: Article
UDC: 519.725
Language: Russian
Citation: S. M. Ratseev, A. M. Ivantsov, P. A. Buldakovsky, “On decoding algorithms of cyclic codes”, Uchenyye zapiski UlGU. Seriya “Matematika i informatsionnyye tekhnologii”, 2021, no. 1, 87–101
Citation in format AMSBIB
\Bibitem{RatIvaBul21}
\by S.~M.~Ratseev, A.~M.~Ivantsov, P.~A.~Buldakovsky
\paper On decoding algorithms of cyclic codes
\jour Uchenyye zapiski UlGU. Seriya ``Matematika i informatsionnyye tekhnologii''
\yr 2021
\issue 1
\pages 87--101
\mathnet{http://mi.mathnet.ru/ulsu42}
Linking options:
  • https://www.mathnet.ru/eng/ulsu42
  • https://www.mathnet.ru/eng/ulsu/y2021/i1/p87
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Uchenyye zapiski UlGU. Seriya "Matematika i informatsionnyye tekhnologii"
    Statistics & downloads:
    Abstract page:88
    Full-text PDF :181
    References:16
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024