Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Zyablov, Victor Vasilievich

Statistics Math-Net.Ru
Total publications: 60
Scientific articles: 59
Presentations: 3

Number of views:
This page:3313
Abstract pages:28693
Full texts:11319
References:1541
Professor
Doctor of technical sciences (1979)
Speciality: 05.13.17 (Theoretical foundation for informatics)
Birth date: 1.07.1937
E-mail:
Website: http://iitp.ru/ru/users/100.htm
Keywords: information, error correction code, complexity problems in coding theory.
UDC: 621.391.15, 621.391.1, 51, 621.391.25, 519.24, 621.395.15, 512, 519.28, 519.72, 621.391.74, 004.7, 519.27, 621.391.156

Subject:

Information theory. Error correction code. Communication.

   
Main publications:
  1. Blokh E. L., Zyablov V. V., Lineinyi kaskadnye kody, Nauka, 1982, 232 s.
  2. Blokh E. L., Zyablov V. V., Obobschennye kaskadnye kody, Svyaz, 1976, 240 s.  mathscinet
  3. Zyablov V.V., Shavgulidze S. A., Obobschennye kaskadnye pomekhoustoichivye konstruktsii na baze svertochnykh kodov, Nauka, 1991, 207 s.
  4. Zyablov V. V., Korobkov D. L., Portnoi S. L., Vysokoskorostnaya peredacha informatsii v realnykh kanalakh, Radio i Svyaz, 1991, 288 s.

https://www.mathnet.ru/eng/person34558
List of publications on Google Scholar
List of publications on ZentralBlatt

Publications in Math-Net.Ru Citations
2022
1. V. V. Zyablov, F. I. Ivanov, E. A. Krouk, V. R. Sidorenko, “On new problems in asymmetric cryptography based on error-resistant coding”, Probl. Peredachi Inf., 58:2 (2022),  92–111  mathnet 1
2. A. A. Kurmukova, F. I. Ivanov, V. V. Zyablov, “Theoretical and experimental upper and lower bounds on the efficiency of convolutional codes in a binary symmetric channel”, Probl. Peredachi Inf., 58:2 (2022),  24–40  mathnet  mathscinet
2017
3. I. V. Zhilin, V. V. Zyablov, “Generalized error-locating codes with component codes over the same alphabet”, Probl. Peredachi Inf., 53:2 (2017),  16–39  mathnet  elib; Problems Inform. Transmission, 53:2 (2017), 114–135  isi  scopus 2
2016
4. A. A. Kreshchuk, V. V. Zyablov, V. G. Potapov, “Signal Code Constructions for Channels with Powerful Wideband Interference”, Tr. SPIIRAN, 46 (2016),  14–26  mathnet  elib
2015
5. P. S. Rybin, V. V. Zyablov, “Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes”, Probl. Peredachi Inf., 51:3 (2015),  3–14  mathnet  elib; Problems Inform. Transmission, 51:3 (2015), 205–216  isi  scopus 1
2014
6. A. A. Frolov, V. V. Zyablov, “On the capacity of a multiple-access vector adder channel”, Probl. Peredachi Inf., 50:2 (2014),  20–30  mathnet  mathscinet  elib; Problems Inform. Transmission, 50:2 (2014), 133–143  isi  scopus 4
2013
7. F. I. Ivanov, V. V. Zyablov, “Low-density parity-check codes based on Steiner systems and permutation matrices”, Probl. Peredachi Inf., 49:4 (2013),  41–56  mathnet; Problems Inform. Transmission, 49:4 (2013), 333–347  isi  scopus 2
8. D. S. Osipov, A. A. Frolov, V. V. Zyablov, “On the user capacity for a multiple-access system in a vector disjunctive channel with errors”, Probl. Peredachi Inf., 49:4 (2013),  13–27  mathnet; Problems Inform. Transmission, 49:4 (2013), 308–321  isi  scopus 3
2012
9. V. V. Zyablov, P. S. Rybin, “Analysis of the relation between properties of LDPC codes and the Tanner graph”, Probl. Peredachi Inf., 48:4 (2012),  3–29  mathnet; Problems Inform. Transmission, 48:4 (2012), 297–323  isi 7
10. D. S. Osipov, A. A. Frolov, V. V. Zyablov, “Multiple access system for a vector disjunctive channel”, Probl. Peredachi Inf., 48:3 (2012),  52–59  mathnet; Problems Inform. Transmission, 48:3 (2012), 243–249  isi  scopus 27
2011
11. A. Frolov, V. V. Zyablov, “Bounds on the minimum code distance for nonbinary codes based on bipartite graphs”, Probl. Peredachi Inf., 47:4 (2011),  27–42  mathnet  mathscinet; Problems Inform. Transmission, 47:4 (2011), 327–341  isi  scopus 4
12. A. A. Kreshchuk, A. A. Davydov, V. V. Zyablov, “Codes for MIMO transmission based on orthogonal sequences”, Probl. Peredachi Inf., 47:4 (2011),  3–26  mathnet  mathscinet; Problems Inform. Transmission, 47:4 (2011), 305–326  isi  scopus 1
13. A. Wachter, V. R. Sidorenko, M. Bossert, V. V. Zyablov, “On (partial) unit memory codes based on Gabidulin codes”, Probl. Peredachi Inf., 47:2 (2011),  38–51  mathnet  mathscinet; Problems Inform. Transmission, 47:2 (2011), 117–129  isi  scopus 21
2010
14. A. A. Davydov, V. V. Zyablov, R. E. Kalimullin, “Special sequences as subcodes of Reed–Solomon codes”, Probl. Peredachi Inf., 46:4 (2010),  56–82  mathnet  mathscinet; Problems Inform. Transmission, 46:4 (2010), 321–345  isi  scopus 2
15. A. Frolov, V. V. Zyablov, “Asymptotic estimation of the fraction of errors correctable by $q$-ary LDPC codes”, Probl. Peredachi Inf., 46:2 (2010),  47–65  mathnet  mathscinet; Problems Inform. Transmission, 46:2 (2010), 142–159  isi  scopus 16
16. C. Senger, V. R. Sidorenko, M. Bossert, V. V. Zyablov, “Multitrial decoding of concatenated codes using fixed thresholds”, Probl. Peredachi Inf., 46:2 (2010),  30–46  mathnet  mathscinet; Problems Inform. Transmission, 46:2 (2010), 127–141  isi  scopus 6
2009
17. V. V. Zyablov, P. S. Rybin, “Erasure correction by low-density codes”, Probl. Peredachi Inf., 45:3 (2009),  15–32  mathnet  mathscinet  zmath; Problems Inform. Transmission, 45:3 (2009), 204–220  isi  scopus 7
18. V. V. Zyablov, R. Johannesson, M. Lončar, “Low-complexity error correction of Hamming-code-based LDPC codes”, Probl. Peredachi Inf., 45:2 (2009),  25–40  mathnet  mathscinet  zmath; Problems Inform. Transmission, 45:2 (2009), 95–109  isi  scopus 16
2008
19. V. V. Zyablov, D. S. Osipov, “On the Optimum Choice of a Threshold in a Frequency Hopping OFDMA System”, Probl. Peredachi Inf., 44:2 (2008),  23–31  mathnet  mathscinet; Problems Inform. Transmission, 44:2, 91–98  scopus 14
2006
20. C. Medina, V. R. Sidorenko, V. V. Zyablov, “Error Exponents for Product Convolutional Codes”, Probl. Peredachi Inf., 42:3 (2006),  3–20  mathnet  mathscinet; Problems Inform. Transmission, 42:3 (2006), 167–182  scopus 5
2004
21. V. V. Zyablov, R. Johannesson, V. A. Pavlushkov, “Detection and Correction Capabilities of Convolutional Codes”, Probl. Peredachi Inf., 40:3 (2004),  3–12  mathnet  mathscinet  zmath; Problems Inform. Transmission, 40:3 (2004), 187–194 2
2002
22. M. Handlery, S. Höst, R. Johannesson, V. V. Zyablov, “A Distance Measure Tailored to Tailbiting Codes”, Probl. Peredachi Inf., 38:4 (2002),  37–55  mathnet  mathscinet  zmath; Problems Inform. Transmission, 38:4 (2002), 280–295 1
23. M. Handlery, R. Johannesson, V. V. Zyablov, “Distance Approach to Window Decoding”, Probl. Peredachi Inf., 38:3 (2002),  3–19  mathnet  mathscinet  zmath; Problems Inform. Transmission, 38:3 (2002), 169–181
24. M. Handlery, R. Johannesson, V. V. Zyablov, “Encoder and Distance Properties of Woven Convolutional Codes with One Tailbiting Component Code”, Probl. Peredachi Inf., 38:1 (2002),  48–58  mathnet  mathscinet  zmath; Problems Inform. Transmission, 38:1 (2002), 41–49 5
1999
25. V. V. Zyablov, R. Johannesson, O. D. Skopintsev, S. Höst, “Asymptotic Distance Properties of Binary Woven Convolutional Codes”, Probl. Peredachi Inf., 35:4 (1999),  29–46  mathnet  mathscinet  zmath; Problems Inform. Transmission, 35:4 (1999), 311–326 3
1998
26. V. V. Zyablov, R. Johannesson, S. Höst, “Nonequivalent Cascaded Convolutional Codes Obtained from Equivalent Constituent Convolutional Encoders”, Probl. Peredachi Inf., 34:4 (1998),  3–12  mathnet  mathscinet; Problems Inform. Transmission, 34:4 (1998), 291–299
1997
27. M. Bossert, M. Breitbach, V. V. Zyablov, V. R. Sidorenko, “Codes Correcting a Set of Clusters of Errors or Erasures”, Probl. Peredachi Inf., 33:4 (1997),  15–25  mathnet  mathscinet  zmath; Problems Inform. Transmission, 33:4 (1997), 297–306 2
1996
28. V. V. Zyablov, J. Justesen, C. Thommesen, S. A. Shavgulidze, “Bounds on Distances for Unit Memory Concatenated Codes”, Probl. Peredachi Inf., 32:1 (1996),  58–69  mathnet  mathscinet  zmath; Problems Inform. Transmission, 31:1 (1996), 48–57 2
1994
29. V. V. Zyablov, J. Justesen, U. Dettmar, U. K. Sorger, “Decoding Concatenated Codes with Inner Convolutional Codes”, Probl. Peredachi Inf., 30:2 (1994),  3–9  mathnet  mathscinet  zmath; Problems Inform. Transmission, 30:2 (1994), 95–101
1993
30. V. V. Zyablov, S. A. Shavgulidze, “Generalized Convolutional-Block Concatenated Constructions Based on 4FM Signals”, Probl. Peredachi Inf., 29:4 (1993),  11–17  mathnet  zmath; Problems Inform. Transmission, 29:4 (1993), 306–312
31. V. V. Zyablov, V. G. Potapov, V. R. Sidorenko, “Maximum-Likelihood List Decoding Using Trellises”, Probl. Peredachi Inf., 29:4 (1993),  3–10  mathnet  mathscinet  zmath; Problems Inform. Transmission, 29:4 (1993), 299–305
32. V. V. Zyablov, V. R. Sidorenko, “Bounds on Complexity of Trellis Decoding of Linear Block Codes”, Probl. Peredachi Inf., 29:3 (1993),  3–9  mathnet  mathscinet  zmath; Problems Inform. Transmission, 29:3 (1993), 203–208 4
1992
33. V. V. Zyablov, N. A. Ugrelidze, S. A. Shavgulidze, “Characteristics of Systems Based on CPFSK Signals and Convolutional Codes”, Probl. Peredachi Inf., 28:1 (1992),  28–38  mathnet  zmath; Problems Inform. Transmission, 28:1 (1992), 23–32
34. V. V. Zyablov, V. R. Sidorenko, “Soft-Decision Maximum-Likelihood Decoding of Partial-Unit-Memory Codes”, Probl. Peredachi Inf., 28:1 (1992),  22–27  mathnet  zmath; Problems Inform. Transmission, 28:1 (1992), 18–22
1991
35. V. V. Zyablov, S. L. Portnoi, “Fast Maximum-Likelihood Decoding of Reed–Muller Codes”, Probl. Peredachi Inf., 27:4 (1991),  39–50  mathnet  mathscinet  zmath; Problems Inform. Transmission, 27:4 (1991), 307–317
36. V. V. Zyablov, S. L. Portnoi, “Construction of Partial-Unit-Memory Convolutional Codes Based on Reed–Muller Codes”, Probl. Peredachi Inf., 27:3 (1991),  3–15  mathnet  mathscinet  zmath; Problems Inform. Transmission, 27:3 (1991), 189–198
37. V. V. Zyablov, S. L. Portnoi, “Signal-Code Constructions without Zero Spectral Component”, Probl. Peredachi Inf., 27:1 (1991),  37–49  mathnet  zmath; Problems Inform. Transmission, 27:1 (1991), 30–39
1989
38. V. V. Zyablov, S. A. Shavgulidze, “On the Existence of $q$-ary Generalized Concatenated Codes with Optimal Error-Correcting Properties”, Probl. Peredachi Inf., 25:2 (1989),  29–45  mathnet  mathscinet  zmath; Problems Inform. Transmission, 25:2 (1989), 107–119
1988
39. V. V. Zyablov, S. L. Portnoi, S. A. Shavgulidze, “The exponent of the error probability in various modulation and encoding systems”, Avtomat. i Telemekh., 1988, no. 9,  169–179  mathnet  mathscinet  zmath; Autom. Remote Control, 49:9 (1988), 1245–1252
40. V. V. Zyablov, S. L. Portnoi, S. A. Shavgulidze, “Construction and Characteristics of New Modulation/Convolutional Coding Systems”, Probl. Peredachi Inf., 24:4 (1988),  17–28  mathnet  mathscinet  zmath; Problems Inform. Transmission, 24:4 (1988), 272–280 1
1987
41. V. V. Zyablov, S. L. Portnoi, “Modulation/Coding System for a Gaussian Channel”, Probl. Peredachi Inf., 23:3 (1987),  18–26  mathnet  mathscinet; Problems Inform. Transmission, 23:3 (1987), 187–193
42. V. V. Zyablov, S. A. Shavgulidze, “A Bound on the Distance of Unit Memory Generalized Convolutional Concatenated Codes”, Probl. Peredachi Inf., 23:2 (1987),  17–27  mathnet  mathscinet  zmath; Problems Inform. Transmission, 23:2 (1987), 102–110 2
1986
43. V. V. Zyablov, S. A. Shavgulidze, “Generalized Unit-Memory Convolutional Concatenated Codes”, Probl. Peredachi Inf., 22:4 (1986),  9–28  mathnet  mathscinet  zmath; Problems Inform. Transmission, 22:4 (1986), 256–271 1
1984
44. V. V. Zyablov, S. A. Shavgulidze, “Comparision of Decoding Comlexity for Truncated Convolutional Codes and Block Codes”, Probl. Peredachi Inf., 20:1 (1984),  105–109  mathnet  zmath
1981
45. V. V. Zyablov, M. S. Pinsker, “List Concatenated Decoding”, Probl. Peredachi Inf., 17:4 (1981),  29–33  mathnet  mathscinet  zmath; Problems Inform. Transmission, 17:4 (1981), 236–240 6
1979
46. V. A. Zinov'ev, V. V. Zyablov, “Codes with Unequal Protection of Information Symbols”, Probl. Peredachi Inf., 15:3 (1979),  50–60  mathnet  mathscinet  zmath; Problems Inform. Transmission, 15:3 (1979), 197–205 3
47. L. A. Bassalygo, V. A. Zinov'ev, V. V. Zyablov, M. S. Pinsker, G. Sh. Poltyrev, “Bounds for Codes with Unequal Protection of Two Sets of Messag”, Probl. Peredachi Inf., 15:3 (1979),  40–49  mathnet  mathscinet  zmath; Problems Inform. Transmission, 15:3 (1979), 190–197 2
48. V. A. Zinov'ev, V. V. Zyablov, “Correction of Error Bursts and Independent Errors using Generalized Concatenated Codes”, Probl. Peredachi Inf., 15:2 (1979),  58–70  mathnet  mathscinet  zmath; Problems Inform. Transmission, 15:2 (1979), 125–134 3
1978
49. V. A. Zinov'ev, V. V. Zyablov, “Decoding of Nonlinear Generalized Concatenated Codes”, Probl. Peredachi Inf., 14:2 (1978),  46–52  mathnet  mathscinet  zmath; Problems Inform. Transmission, 14:2 (1978), 110–114
1977
50. V. V. Zyablov, A. M. Samarov, R. Z. Khas'minskii, “On Problems of Estimation with Limited Resources”, Probl. Peredachi Inf., 13:3 (1977),  32–44  mathnet  mathscinet  zmath; Problems Inform. Transmission, 13:3 (1977), 185–194
51. L. A. Bassalygo, V. V. Zyablov, M. S. Pinsker, “Problems of Complexity in the Theory of Correcting Codes”, Probl. Peredachi Inf., 13:3 (1977),  5–17  mathnet  mathscinet  zmath; Problems Inform. Transmission, 13:3 (1977), 166–175
1975
52. V. V. Zyablov, M. S. Pinsker, “Estimation of the error-correction complexity for Gallager low-density codes”, Probl. Peredachi Inf., 11:1 (1975),  23–36  mathnet  mathscinet  zmath; Problems Inform. Transmission, 11:1 (1975), 18–28 21
1974
53. È. L. Blokh, V. V. Zyablov, “Coding of Generalized Concatenated Codes”, Probl. Peredachi Inf., 10:3 (1974),  45–50  mathnet  mathscinet  zmath; Problems Inform. Transmission, 10:3 (1974), 218–222 11
54. V. V. Zyablov, M. S. Pinsker, “Decoding Complexity of Low-Density Codes For Transmission in a Channel with Erasures”, Probl. Peredachi Inf., 10:1 (1974),  15–28  mathnet  mathscinet  zmath; Problems Inform. Transmission, 10:1 (1974), 10–21 3
1973
55. È. L. Blokh, V. V. Zyablov, “Existence of Linear Concatenated Binary Codes with Optimal Correcting Properties”, Probl. Peredachi Inf., 9:4 (1973),  3–10  mathnet  mathscinet  zmath; Problems Inform. Transmission, 9:4 (1973), 271–276
56. V. V. Zyablov, “Optimization of Concatenated Decoding Algorithms”, Probl. Peredachi Inf., 9:1 (1973),  26–32  mathnet  mathscinet  zmath; Problems Inform. Transmission, 9:1 (1973), 19–24 3
57. L. F. Zhigulin, V. V. Zyablov, “Error Probability Exponent for a Feedback System with the Use of a Concatenated Code”, Probl. Peredachi Inf., 9:1 (1973),  3–10  mathnet  mathscinet  zmath; Problems Inform. Transmission, 9:1 (1973), 1–6
1971
58. V. V. Zyablov, “An Estimate of the Complexity of Constructing Binary Linear Cascade Codes”, Probl. Peredachi Inf., 7:1 (1971),  5–13  mathnet; Problems Inform. Transmission, 7:1 (1971), 3–10 1
1968
59. V. V. Zyablov, “Piecewise-Cyclic Codes and Their Majority Decoding Schemes”, Probl. Peredachi Inf., 4:2 (1968),  31–37  mathnet  mathscinet  zmath; Problems Inform. Transmission, 4:1 (1968), 23–27

2004
60. 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

Presentations in Math-Net.Ru
1. Сверточные коды и локально декодируемые коды
V. V. Zyablov
Seminar on Coding Theory
February 7, 2017 19:00
2. Проблемы создания сигнально-кодовых конструкций для бесконфликтных сетей связи
V. V. Zyablov
Seminar on Coding Theory
January 26, 2016 19:00
3. State of the art and prospects of coding theory vs requirements of the coming generations of telecommunication systems
V. V. Zyablov
Information Technologies and Systems 2013
September 5, 2013 15:30   

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