RUS  ENG
Full version
JOURNALS // Taurida Journal of Computer Science Theory and Mathematics // Archive

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.

UDC: 519.725, 621.3.049.771.14

MSC: 94B05, 68R99



© Steklov Math. Inst. of RAS, 2024