Taurida Journal of Computer Science Theory and Mathematics
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



Taurida Journal of Computer Science Theory and Mathematics:
Year:
Volume:
Issue:
Page:
Find






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


Taurida Journal of Computer Science Theory and Mathematics, 2018, Issue 2, Pages 29–44 (Mi tvim45)  

Synthesis of fault-tolerant combination schemes by introducing information redundancy

S. V. Gavrilova, S. I. Gurovb, D. V. Telpukhova, T. D. Zhukovaa

a Institute for Design Problems in Microelectronics of Russian Academy of Sciences, Moscow
b Lomonosov Moscow State University, Faculty of Computational Mathematics and Cybernetics
Abstract: In the article, based on the analysis of the specifics of the problem of increasing the fault tolerance of combinational integrated circuits, the requirements for such a code are formulated by the methods of excessive coding. A linear non-cyclic code with parity checks satisfying these requirements is proposed. The code fixes single errors, detects double errors and has the advantages that are essential for the task at hand. The efficiency of the proposed code is estimated.
Keywords: Synthesis of fault-tolerant circuits, redundant coding, codes with parity checks, R-code.
Funding agency Grant number
Russian Science Foundation 17–19–01645
Document Type: Article
UDC: 519.725, 621.3.049.771.14
MSC: 94B05, 68R99
Language: Russian
Citation: S. V. Gavrilov, S. I. Gurov, D. V. Telpukhov, T. D. Zhukova, “Synthesis of fault-tolerant combination schemes by introducing information redundancy”, Taurida Journal of Computer Science Theory and Mathematics, 2018, no. 2, 29–44
Citation in format AMSBIB
\Bibitem{GavGurTel18}
\by S.~V.~Gavrilov, S.~I.~Gurov, D.~V.~Telpukhov, T.~D.~Zhukova
\paper Synthesis of fault-tolerant combination schemes by introducing information redundancy
\jour Taurida Journal of Computer Science Theory and Mathematics
\yr 2018
\issue 2
\pages 29--44
\mathnet{http://mi.mathnet.ru/tvim45}
Linking options:
  • https://www.mathnet.ru/eng/tvim45
  • https://www.mathnet.ru/eng/tvim/y2018/i2/p29
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Taurida Journal of Computer Science Theory and Mathematics
    Statistics & downloads:
    Abstract page:109
    Full-text PDF :50
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024