Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Sagalovich, Yurii L'vovich
(1924–2018)
Statistics Math-Net.Ru
Total publications: 40
Scientific articles: 38

Number of views:
This page:1010
Abstract pages:10282
Full texts:4790
References:268
Professor
Doctor of technical sciences (1982)
Birth date: 10.08.1924
Website: http://iitp.ru/ru/about/449.htm

https://www.mathnet.ru/eng/person29519
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/251956
https://elibrary.ru/author_items.asp?authorid=2270

Publications in Math-Net.Ru Citations
2009
1. S. A. Kalinchuk, Yu. L. Sagalovich, “Generating ordered set of symmetric group for solving commutation problems”, Avtomat. i Telemekh., 2009, no. 2,  142–152  mathnet  mathscinet  zmath  elib; Autom. Remote Control, 70:2 (2009), 301–311  isi  elib  scopus 2
2. S. A. Kalinchuk, Yu. L. Sagalovich, “The smallest known length of an ordered system of generators of a symmetric group”, Probl. Peredachi Inf., 45:3 (2009),  56–72  mathnet  mathscinet  zmath  elib; Problems Inform. Transmission, 45:3 (2009), 242–257  isi  scopus
2004
3. S. A. Kuryshin, Yu. L. Sagalovich, “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  mathnet  mathscinet  zmath; Autom. Remote Control, 65:7 (2004), 1129–1135  scopus
2001
4. A. R. Akhkyamov, S. A. Kuryshin, Yu. L. Sagalovich, “Diagnostics of Processor Networks with Regular Structure”, Avtomat. i Telemekh., 2001, no. 12,  74–82  mathnet  mathscinet  zmath; Autom. Remote Control, 62:12 (2001), 1996–2003  isi  scopus 1
2000
5. A. S. Andreev, Yu. L. Sagalovich, “Diagnosis of short-circuit failures in the programmable logic array”, Avtomat. i Telemekh., 2000, no. 5,  133–140  mathnet  zmath; Autom. Remote Control, 61:5 (2000), 837–843
6. Yu. L. Sagalovich, “On algebraic diagnostics”, Avtomat. i Telemekh., 2000, no. 1,  157–164  mathnet  mathscinet  zmath; Autom. Remote Control, 61:1 (2000), 149–156
1998
7. V. Yu. Solomennikov, Yu. L. Sagalovich, “On Linear Hash Codes”, Probl. Peredachi Inf., 34:4 (1998),  13–22  mathnet  mathscinet  zmath; Problems Inform. Transmission, 34:4 (1998), 300–308 1
1997
8. Yu. L. Sagalovich, V. Yu. Solomennikov, “Fault Detection in Network Realizations of Systems of Monotone Boolean Functions”, Probl. Peredachi Inf., 33:2 (1997),  81–93  mathnet  mathscinet  zmath; Problems Inform. Transmission, 33:2 (1997), 163–173 2
1996
9. Yu. L. Sagalovich, “Improving Parameter Estimates and Shortening the Procedure of Design of Efficient Diagnostic Polynomials”, Probl. Peredachi Inf., 32:2 (1996),  77–88  mathnet  mathscinet  zmath; Problems Inform. Transmission, 32:2 (1996), 205–215 3
1994
10. Yu. L. Sagalovich, “The shortest signature analyzer”, Avtomat. i Telemekh., 1994, no. 7,  169–175  mathnet  zmath; Autom. Remote Control, 55:7 (1994), 1068–1073
11. Yu. L. Sagalovich, “Separaring Systems”, Probl. Peredachi Inf., 30:2 (1994),  14–35  mathnet  mathscinet  zmath; Problems Inform. Transmission, 30:2 (1994), 105–123 12
1993
12. Yu. L. Sagalovich, “New Upper Bounds on Cardinality of Separating Systems”, Probl. Peredachi Inf., 29:2 (1993),  109–111  mathnet  mathscinet  zmath; Problems Inform. Transmission, 29:2 (1993), 199–202 2
1992
13. Yu. L. Sagalovich, “Diagnostics of combinational circuits, and cyclic codes over an extension of a finite field”, Avtomat. i Telemekh., 1992, no. 12,  122–133  mathnet  mathscinet  zmath; Autom. Remote Control, 53:12 (1992), 1928–1937
14. Yu. L. Sagalovich, “Some peculiarities of a signature analyzer over an extended finite field”, Avtomat. i Telemekh., 1992, no. 5,  138–146  mathnet  mathscinet  zmath; Autom. Remote Control, 53:5 (1992), 745–751
15. Yu. L. Sagalovich, “Partitioning of a Vector Space into Orbits by the Action of Automorphism Groups of Some Codes”, Probl. Peredachi Inf., 28:2 (1992),  54–61  mathnet  mathscinet  zmath; Problems Inform. Transmission, 28:2 (1992), 147–153
1991
16. Yu. L. Sagalovich, “Error-correcting codes for computer memories”, Avtomat. i Telemekh., 1991, no. 5,  3–45  mathnet  zmath; Autom. Remote Control, 52:5 (1991), 595–627
17. Yu. L. Sagalovich, “Classes of errors in diagnostic responses and appropriate signature analyzers”, Avtomat. i Telemekh., 1991, no. 1,  113–121  mathnet  zmath; Autom. Remote Control, 52:1 (1991), 93–99
1990
18. Yu. L. Sagalovich, V. N. Yarmolik, “Synthesis of a signature analyzer for two-level combinational circuits”, Avtomat. i Telemekh., 1990, no. 4,  155–160  mathnet  zmath; Autom. Remote Control, 51:4 (1990), 549–553
1988
19. Yu. L. Sagalovich, “The potential of a fixed signature analyzer with arbitrary extension of the test sequence”, Avtomat. i Telemekh., 1988, no. 6,  144–157  mathnet  mathscinet  zmath; Autom. Remote Control, 49:6 (1988), 802–813
20. Yu. L. Sagalovich, “On One Property of the Hamming Code”, Probl. Peredachi Inf., 24:1 (1988),  102–105  mathnet  mathscinet  zmath; Problems Inform. Transmission, 24:1 (1988), 79–81
1987
21. Yu. L. Sagalovich, A. A. Shalyto, “Binary Programs and Their Realization by Asynchronous Automata”, Probl. Peredachi Inf., 23:1 (1987),  89–96  mathnet; Problems Inform. Transmission, 23:1 (1987), 74–80
1984
22. Yu. L. Sagalovich, S. N. Shcherbakov, “Choice of Coding System for Error Protection of Storage Devices”, Probl. Peredachi Inf., 20:1 (1984),  19–27  mathnet; Problems Inform. Transmission, 20:1 (1984), 14–20
1982
23. Yu. L. Sagalovich, “Completely Separating Systems”, Probl. Peredachi Inf., 18:2 (1982),  74–82  mathnet  mathscinet  zmath; Problems Inform. Transmission, 18:2 (1982), 140–146 7
1979
24. Yu. L. Sagalovich, “Asymptotic Behavior of the Number of Types of Equivalent Binary Connection Matrices”, Probl. Peredachi Inf., 15:2 (1979),  97–105  mathnet  mathscinet  zmath; Problems Inform. Transmission, 15:2 (1979), 152–158
1978
25. Yu. L. Sagalovich, “Concatenated Codes of Automaton States”, Probl. Peredachi Inf., 14:2 (1978),  77–85  mathnet  mathscinet  zmath; Problems Inform. Transmission, 14:2 (1978), 132–138 2
1976
26. Yu. L. Sagalovich, “Sequences of Maximum Length as Automaton State Codes”, Probl. Peredachi Inf., 12:4 (1976),  70–73  mathnet  mathscinet  zmath; Problems Inform. Transmission, 12:4 (1976), 296–299
1973
27. Yu. L. Sagalovich, “Upper Bound for the Power of an Automaton State Code”, Probl. Peredachi Inf., 9:1 (1973),  73–83  mathnet  mathscinet  zmath; Problems Inform. Transmission, 9:1 (1973), 55–63 2
1972
28. M. S. Pinsker, Yu. L. Sagalovich, “Lower Bound for the Power of an Automaton State Code”, Probl. Peredachi Inf., 8:3 (1972),  58–66  mathnet  mathscinet; Problems Inform. Transmission, 8:3 (1972), 224–230 3
1971
29. Yu. L. Sagalovich, “Complexity of Circuit Implementation of Reed’s Algorithm and Decoding in an Automaton”, Probl. Peredachi Inf., 7:1 (1971),  23–28  mathnet; Problems Inform. Transmission, 7:1 (1971), 18–22
1969
30. Yu. L. Sagalovich, “Complexity of the Combinational Unit under Noise-Immune Coding of the States of an Automaton”, Probl. Peredachi Inf., 5:3 (1969),  37–45  mathnet; Problems Inform. Transmission, 5:3 (1969), 29–34
1968
31. Yu. L. Sagalovich, “Methods of Introducing Redundancy for Raising the Reliability of a Finite Automaton”, Probl. Peredachi Inf., 4:3 (1968),  62–72  mathnet  mathscinet  zmath; Problems Inform. Transmission, 4:3 (1968), 49–57
1967
32. Yu. L. Sagalovich, “Memory Contraction for an Automaton Stable to Injuries and Competitions in Its Internal Elements”, Probl. Peredachi Inf., 3:2 (1967),  73–85  mathnet  mathscinet  zmath; Problems Inform. Transmission, 3:2 (1967), 56–64
1966
33. Yu. L. Sagalovich, “Noise-Resistant State Assignment Method for Asynchronous Finite Automata”, Probl. Peredachi Inf., 2:2 (1966),  54–59  mathnet; Problems Inform. Transmission, 2:2 (1966), 42–47
1965
34. Yu. L. Sagalovich, “A method for increasing the reliability of finite automata”, Probl. Peredachi Inf., 1:2 (1965),  27–35  mathnet  mathscinet; Problems Inform. Transmission, 1:2 (1965), 19–25 2
35. Yu. L. Sagalovich, “Cyclic codes capable of correcting uniform error bursts”, Probl. Peredachi Inf., 1:1 (1965),  117–121  mathnet  zmath
1961
36. Yu. L. Sagalovich, “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  mathnet  mathscinet  zmath
1960
37. Yu. L. Sagalovich, “Number of symmetry types among $(1,k)$ terminal contacts”, Dokl. Akad. Nauk SSSR, 130:1 (1960),  72–73  mathnet  mathscinet  zmath
1959
38. Yu. L. Sagalovich, “On group invariance of Boolean functions”, Uspekhi Mat. Nauk, 14:6(90) (1959),  191–195  mathnet  mathscinet  zmath
2004
39. A. M. Barg, L. A. Bassalygo, V. M. Blinovskii, M. V. Burnashev, N. D. Vvedenskaya, G. K. Golubev, I. I. Dumer, K. Sh. Zigangirov, V. V. Zyablov, V. A. Zinov'ev, G. A. Kabatiansky, V. D. Kolesnik, N. A. Kuznetsov, V. A. Malyshev, R. A. Minlos, D. Yu. Nogin, I. A. Ovseevich, V. V. Prelov, Yu. L. Sagalovich, V. M. Tikhomirov, R. Z. Khas'minskii, B. S. Tsybakov, “Mark Semenovich Pinsker. In Memoriam”, Probl. Peredachi Inf., 40:1 (2004),  3–5  mathnet  mathscinet; Problems Inform. Transmission, 40:1 (2004), 1–4 2
1969
40. Yu. L. Sagalovich, “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  mathnet

Organisations
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024