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, 1983, Volume 19, Issue 3, Pages 102–106 (Mi ppi1193)  
Сorrespondence

Arithmetic $(n,A)$-Codes Dual to Iterative Codes

I. M. Boyarinov
Full-text PDF (530 kB)
Abstract: Arithmetic cyclic $(n,A)$-codes dual to iterative codes and their subcodes are considered. We determine the minimum distance and describe a majority decoding algorithm for these codes.
Received: 10.11.1981
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: I. M. Boyarinov, “Arithmetic $(n,A)$-Codes Dual to Iterative Codes”, Probl. Peredachi Inf., 19:3 (1983), 102–106
Citation in format AMSBIB
\Bibitem{Boy83}
\by I.~M.~Boyarinov
\paper Arithmetic $(n,A)$-Codes Dual to Iterative Codes
\jour Probl. Peredachi Inf.
\yr 1983
\vol 19
\issue 3
\pages 102--106
\mathnet{http://mi.mathnet.ru/ppi1193}
\zmath{https://zbmath.org/?q=an:0551.94012}
Linking options:
  • https://www.mathnet.ru/eng/ppi1193
  • https://www.mathnet.ru/eng/ppi/v19/i3/p102
    • 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, 2025