Sagalovich Yurii L'vovich

Publications in Math-Net.Ru

1. Generating ordered set of symmetric group for solving commutation problems
   
   Avtomat. i Telemekh., 2009, no. 2,  142–152
2. The smallest known length of an ordered system of generators of a symmetric group
   
   Probl. Peredachi Inf., 45:3 (2009),  56–72
3. Indication of faulty vertex in the binary network of modules on the assumption of random error propagation
   
   Avtomat. i Telemekh., 2004, no. 7,  106–113
4. Diagnostics of Processor Networks with Regular Structure
   
   Avtomat. i Telemekh., 2001, no. 12,  74–82
5. Diagnosis of short-circuit failures in the programmable logic array
   
   Avtomat. i Telemekh., 2000, no. 5,  133–140
6. On algebraic diagnostics
   
   Avtomat. i Telemekh., 2000, no. 1,  157–164
7. On Linear Hash Codes
   
   Probl. Peredachi Inf., 34:4 (1998),  13–22
8. Fault Detection in Network Realizations of Systems of Monotone Boolean Functions
   
   Probl. Peredachi Inf., 33:2 (1997),  81–93
9. Improving Parameter Estimates and Shortening the Procedure of Design of Efficient Diagnostic Polynomials
   
   Probl. Peredachi Inf., 32:2 (1996),  77–88
10. The shortest signature analyzer
    
    Avtomat. i Telemekh., 1994, no. 7,  169–175
11. Separaring Systems
    
    Probl. Peredachi Inf., 30:2 (1994),  14–35
12. New Upper Bounds on Cardinality of Separating Systems
    
    Probl. Peredachi Inf., 29:2 (1993),  109–111
13. Diagnostics of combinational circuits, and cyclic codes over an extension of a finite field
    
    Avtomat. i Telemekh., 1992, no. 12,  122–133
14. Some peculiarities of a signature analyzer over an extended finite field
    
    Avtomat. i Telemekh., 1992, no. 5,  138–146
15. Partitioning of a Vector Space into Orbits by the Action of Automorphism Groups of Some Codes
    
    Probl. Peredachi Inf., 28:2 (1992),  54–61
16. Error-correcting codes for computer memories
    
    Avtomat. i Telemekh., 1991, no. 5,  3–45
17. Classes of errors in diagnostic responses and appropriate signature analyzers
    
    Avtomat. i Telemekh., 1991, no. 1,  113–121
18. Synthesis of a signature analyzer for two-level combinational circuits
    
    Avtomat. i Telemekh., 1990, no. 4,  155–160
19. The potential of a fixed signature analyzer with arbitrary extension of the test sequence
    
    Avtomat. i Telemekh., 1988, no. 6,  144–157
20. On One Property of the Hamming Code
    
    Probl. Peredachi Inf., 24:1 (1988),  102–105
21. Binary Programs and Their Realization by Asynchronous Automata
    
    Probl. Peredachi Inf., 23:1 (1987),  89–96
22. Choice of Coding System for Error Protection of Storage Devices
    
    Probl. Peredachi Inf., 20:1 (1984),  19–27
23. Completely Separating Systems
    
    Probl. Peredachi Inf., 18:2 (1982),  74–82
24. Asymptotic Behavior of the Number of Types of Equivalent Binary Connection Matrices
    
    Probl. Peredachi Inf., 15:2 (1979),  97–105
25. Concatenated Codes of Automaton States
    
    Probl. Peredachi Inf., 14:2 (1978),  77–85
26. Sequences of Maximum Length as Automaton State Codes
    
    Probl. Peredachi Inf., 12:4 (1976),  70–73
27. Upper Bound for the Power of an Automaton State Code
    
    Probl. Peredachi Inf., 9:1 (1973),  73–83
28. Lower Bound for the Power of an Automaton State Code
    
    Probl. Peredachi Inf., 8:3 (1972),  58–66
29. Complexity of Circuit Implementation of Reed’s Algorithm and Decoding in an Automaton
    
    Probl. Peredachi Inf., 7:1 (1971),  23–28
30. Complexity of the Combinational Unit under Noise-Immune Coding of the States of an Automaton
    
    Probl. Peredachi Inf., 5:3 (1969),  37–45
31. Methods of Introducing Redundancy for Raising the Reliability of a Finite Automaton
    
    Probl. Peredachi Inf., 4:3 (1968),  62–72
32. Memory Contraction for an Automaton Stable to Injuries and Competitions in Its Internal Elements
    
    Probl. Peredachi Inf., 3:2 (1967),  73–85
33. Noise-Resistant State Assignment Method for Asynchronous Finite Automata
    
    Probl. Peredachi Inf., 2:2 (1966),  54–59
34. A method for increasing the reliability of finite automata
    
    Probl. Peredachi Inf., 1:2 (1965),  27–35
35. Cyclic codes capable of correcting uniform error bursts
    
    Probl. Peredachi Inf., 1:1 (1965),  117–121
36. Proof that a minimum number of contacts are required in the realization of a class of Boolean functions of $n$ variables
    
    Dokl. Akad. Nauk SSSR, 139:5 (1961),  1075–1076
37. Number of symmetry types among $(1,k)$ terminal contacts
    
    Dokl. Akad. Nauk SSSR, 130:1 (1960),  72–73
38. On group invariance of Boolean functions
    
    Uspekhi Mat. Nauk, 14:6(90) (1959),  191–195


39. Mark Semenovich Pinsker. In Memoriam
    
    Probl. Peredachi Inf., 40:1 (2004),  3–5
40. Review of the Book by V. D. Kolesnik, E. T. Mironchikov “Decoding of Cyclical Codes”, M., “Svjaz”, 1968
    
    Probl. Peredachi Inf., 5:1 (1969),  101–103