This article is cited 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.

UDC: 621.391.15:62-507

Received: 13.01.1982
Revised: 26.11.1982

 English version: Problems of Information Transmission, 1984, 20:2, 128–137

Bibliographic databases:

•