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, 1971, Volume 7, Issue 1, Pages 23–28 (Mi ppi1619)  
Coding Theory

Complexity of Circuit Implementation of Reed’s Algorithm and Decoding in an Automaton

Yu. L. Sagalovich
Full-text PDF (464 kB)
Abstract: The author obtains upper bounds for the number of functional elements in circuits which implement Reed’s decoding algorithm and threshold decoding of maximum-length codes. It is shown that decoders are inapplicable for error correction in an automaton memory unit when there are races between the internal elements.
Received: 17.11.1969
Document Type: Article
UDC: 621.391.15:62-507
Language: Russian
Citation: Yu. L. Sagalovich, “Complexity of Circuit Implementation of Reed’s Algorithm and Decoding in an Automaton”, Probl. Peredachi Inf., 7:1 (1971), 23–28; Problems Inform. Transmission, 7:1 (1971), 18–22
Citation in format AMSBIB
\Bibitem{Sag71}
\by Yu.~L.~Sagalovich
\paper Complexity of Circuit Implementation of Reed’s Algorithm and Decoding in an Automaton
\jour Probl. Peredachi Inf.
\yr 1971
\vol 7
\issue 1
\pages 23--28
\mathnet{http://mi.mathnet.ru/ppi1619}
\transl
\jour Problems Inform. Transmission
\yr 1971
\vol 7
\issue 1
\pages 18--22
Linking options:
  • https://www.mathnet.ru/eng/ppi1619
  • https://www.mathnet.ru/eng/ppi/v7/i1/p23
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Ïðîáëåìû ïåðåäà÷è èíôîðìàöèè Problems of Information Transmission
    Statistics & downloads:
    Abstract page:224
    Full-text PDF :110
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024