Zyablov Victor Vasilievich

Publications in Math-Net.Ru

1. On new problems in asymmetric cryptography based on error-resistant coding
   
   Probl. Peredachi Inf., 58:2 (2022),  92–111
2. 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
3. Generalized error-locating codes with component codes over the same alphabet
   
   Probl. Peredachi Inf., 53:2 (2017),  16–39
4. Signal Code Constructions for Channels with Powerful Wideband Interference
   
   Tr. SPIIRAN, 46 (2016),  14–26
5. Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes
   
   Probl. Peredachi Inf., 51:3 (2015),  3–14
6. On the capacity of a multiple-access vector adder channel
   
   Probl. Peredachi Inf., 50:2 (2014),  20–30
7. Low-density parity-check codes based on Steiner systems and permutation matrices
   
   Probl. Peredachi Inf., 49:4 (2013),  41–56
8. On the user capacity for a multiple-access system in a vector disjunctive channel with errors
   
   Probl. Peredachi Inf., 49:4 (2013),  13–27
9. Analysis of the relation between properties of LDPC codes and the Tanner graph
   
   Probl. Peredachi Inf., 48:4 (2012),  3–29
10. Multiple access system for a vector disjunctive channel
    
    Probl. Peredachi Inf., 48:3 (2012),  52–59
11. Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
    
    Probl. Peredachi Inf., 47:4 (2011),  27–42
12. Codes for MIMO transmission based on orthogonal sequences
    
    Probl. Peredachi Inf., 47:4 (2011),  3–26
13. On (partial) unit memory codes based on Gabidulin codes
    
    Probl. Peredachi Inf., 47:2 (2011),  38–51
14. Special sequences as subcodes of Reed–Solomon codes
    
    Probl. Peredachi Inf., 46:4 (2010),  56–82
15. Asymptotic estimation of the fraction of errors correctable by $q$-ary LDPC codes
    
    Probl. Peredachi Inf., 46:2 (2010),  47–65
16. Multitrial decoding of concatenated codes using fixed thresholds
    
    Probl. Peredachi Inf., 46:2 (2010),  30–46
17. Erasure correction by low-density codes
    
    Probl. Peredachi Inf., 45:3 (2009),  15–32
18. Low-complexity error correction of Hamming-code-based LDPC codes
    
    Probl. Peredachi Inf., 45:2 (2009),  25–40
19. On the Optimum Choice of a Threshold in a Frequency Hopping OFDMA System
    
    Probl. Peredachi Inf., 44:2 (2008),  23–31
20. Error Exponents for Product Convolutional Codes
    
    Probl. Peredachi Inf., 42:3 (2006),  3–20
21. Detection and Correction Capabilities of Convolutional Codes
    
    Probl. Peredachi Inf., 40:3 (2004),  3–12
22. A Distance Measure Tailored to Tailbiting Codes
    
    Probl. Peredachi Inf., 38:4 (2002),  37–55
23. Distance Approach to Window Decoding
    
    Probl. Peredachi Inf., 38:3 (2002),  3–19
24. Encoder and Distance Properties of Woven Convolutional Codes with One Tailbiting Component Code
    
    Probl. Peredachi Inf., 38:1 (2002),  48–58
25. Asymptotic Distance Properties of Binary Woven Convolutional Codes
    
    Probl. Peredachi Inf., 35:4 (1999),  29–46
26. Nonequivalent Cascaded Convolutional Codes Obtained from Equivalent Constituent Convolutional Encoders
    
    Probl. Peredachi Inf., 34:4 (1998),  3–12
27. Codes Correcting a Set of Clusters of Errors or Erasures
    
    Probl. Peredachi Inf., 33:4 (1997),  15–25
28. Bounds on Distances for Unit Memory Concatenated Codes
    
    Probl. Peredachi Inf., 32:1 (1996),  58–69
29. Decoding Concatenated Codes with Inner Convolutional Codes
    
    Probl. Peredachi Inf., 30:2 (1994),  3–9
30. Generalized Convolutional-Block Concatenated Constructions Based on 4FM Signals
    
    Probl. Peredachi Inf., 29:4 (1993),  11–17
31. Maximum-Likelihood List Decoding Using Trellises
    
    Probl. Peredachi Inf., 29:4 (1993),  3–10
32. Bounds on Complexity of Trellis Decoding of Linear Block Codes
    
    Probl. Peredachi Inf., 29:3 (1993),  3–9
33. Characteristics of Systems Based on CPFSK Signals and Convolutional Codes
    
    Probl. Peredachi Inf., 28:1 (1992),  28–38
34. Soft-Decision Maximum-Likelihood Decoding of Partial-Unit-Memory Codes
    
    Probl. Peredachi Inf., 28:1 (1992),  22–27
35. Fast Maximum-Likelihood Decoding of Reed–Muller Codes
    
    Probl. Peredachi Inf., 27:4 (1991),  39–50
36. Construction of Partial-Unit-Memory Convolutional Codes Based on Reed–Muller Codes
    
    Probl. Peredachi Inf., 27:3 (1991),  3–15
37. Signal-Code Constructions without Zero Spectral Component
    
    Probl. Peredachi Inf., 27:1 (1991),  37–49
38. On the Existence of $q$-ary Generalized Concatenated Codes with Optimal Error-Correcting Properties
    
    Probl. Peredachi Inf., 25:2 (1989),  29–45
39. The exponent of the error probability in various modulation and encoding systems
    
    Avtomat. i Telemekh., 1988, no. 9,  169–179
40. Construction and Characteristics of New Modulation/Convolutional Coding Systems
    
    Probl. Peredachi Inf., 24:4 (1988),  17–28
41. Modulation/Coding System for a Gaussian Channel
    
    Probl. Peredachi Inf., 23:3 (1987),  18–26
42. A Bound on the Distance of Unit Memory Generalized Convolutional Concatenated Codes
    
    Probl. Peredachi Inf., 23:2 (1987),  17–27
43. Generalized Unit-Memory Convolutional Concatenated Codes
    
    Probl. Peredachi Inf., 22:4 (1986),  9–28
44. Comparision of Decoding Comlexity for Truncated Convolutional Codes and Block Codes
    
    Probl. Peredachi Inf., 20:1 (1984),  105–109
45. List Concatenated Decoding
    
    Probl. Peredachi Inf., 17:4 (1981),  29–33
46. Codes with Unequal Protection of Information Symbols
    
    Probl. Peredachi Inf., 15:3 (1979),  50–60
47. Bounds for Codes with Unequal Protection of Two Sets of Messag
    
    Probl. Peredachi Inf., 15:3 (1979),  40–49
48. Correction of Error Bursts and Independent Errors using Generalized Concatenated Codes
    
    Probl. Peredachi Inf., 15:2 (1979),  58–70
49. Decoding of Nonlinear Generalized Concatenated Codes
    
    Probl. Peredachi Inf., 14:2 (1978),  46–52
50. On Problems of Estimation with Limited Resources
    
    Probl. Peredachi Inf., 13:3 (1977),  32–44
51. Problems of Complexity in the Theory of Correcting Codes
    
    Probl. Peredachi Inf., 13:3 (1977),  5–17
52. Estimation of the error-correction complexity for Gallager low-density codes
    
    Probl. Peredachi Inf., 11:1 (1975),  23–36
53. Coding of Generalized Concatenated Codes
    
    Probl. Peredachi Inf., 10:3 (1974),  45–50
54. Decoding Complexity of Low-Density Codes For Transmission in a Channel with Erasures
    
    Probl. Peredachi Inf., 10:1 (1974),  15–28
55. Existence of Linear Concatenated Binary Codes with Optimal Correcting Properties
    
    Probl. Peredachi Inf., 9:4 (1973),  3–10
56. Optimization of Concatenated Decoding Algorithms
    
    Probl. Peredachi Inf., 9:1 (1973),  26–32
57. Error Probability Exponent for a Feedback System with the Use of a Concatenated Code
    
    Probl. Peredachi Inf., 9:1 (1973),  3–10
58. An Estimate of the Complexity of Constructing Binary Linear Cascade Codes
    
    Probl. Peredachi Inf., 7:1 (1971),  5–13
59. Piecewise-Cyclic Codes and Their Majority Decoding Schemes
    
    Probl. Peredachi Inf., 4:2 (1968),  31–37


60. Mark Semenovich Pinsker. In Memoriam
    
    Probl. Peredachi Inf., 40:1 (2004),  3–5