|
Problemy Peredachi Informatsii, 1984, Volume 20, Issue 2, Pages 65–76
(Mi ppi1133)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Automata Theory and Communication-Network Theory
Universal Algorithm for Synthesizing Self-Checking Testers for Constant-Weight Codes
V. V. Sapozhnikov, Vl. V. Sapozhnokov
Abstract:
The authors propose a method that makes it possible to construct self-checking testers for codes with constant weight $m\geq 2$. The method yields testers with minimum complexity as compared to the available ones.
Received: 13.01.1982 Revised: 26.11.1982
Citation:
V. V. Sapozhnikov, Vl. V. Sapozhnokov, “Universal Algorithm for Synthesizing Self-Checking Testers for Constant-Weight Codes”, Probl. Peredachi Inf., 20:2 (1984), 65–76; Problems Inform. Transmission, 20:2 (1984), 128–137
Linking options:
https://www.mathnet.ru/eng/ppi1133 https://www.mathnet.ru/eng/ppi/v20/i2/p65
|
Statistics & downloads: |
Abstract page: | 244 | Full-text PDF : | 110 |
|