Sidorenko Vladimir Removich

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. Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff
   
   Probl. Peredachi Inf., 48:4 (2012),  30–40
3. A linear algebraic approach to multisequence shift-register synthesis
   
   Probl. Peredachi Inf., 47:2 (2011),  72–89
4. On (partial) unit memory codes based on Gabidulin codes
   
   Probl. Peredachi Inf., 47:2 (2011),  38–51
5. Multitrial decoding of concatenated codes using fixed thresholds
   
   Probl. Peredachi Inf., 46:2 (2010),  30–46
6. Error Exponents for Product Convolutional Codes
   
   Probl. Peredachi Inf., 42:3 (2006),  3–20
7. A Posteriory Probability Decoding of Nonsystematically Encoded Block Codes
   
   Probl. Peredachi Inf., 38:3 (2002),  20–33
8. Codes Correcting a Set of Clusters of Errors or Erasures
   
   Probl. Peredachi Inf., 33:4 (1997),  15–25
9. The Euler Characteristic of the Minimal Code Trellis is Maximum
   
   Probl. Peredachi Inf., 33:1 (1997),  87–93
10. Maximum-Likelihood List Decoding Using Trellises
    
    Probl. Peredachi Inf., 29:4 (1993),  3–10
11. Bounds on Complexity of Trellis Decoding of Linear Block Codes
    
    Probl. Peredachi Inf., 29:3 (1993),  3–9
12. Soft-Decision Maximum-Likelihood Decoding of Partial-Unit-Memory Codes
    
    Probl. Peredachi Inf., 28:1 (1992),  22–27
13. On One General Bound for Code Volume
    
    Probl. Peredachi Inf., 12:4 (1976),  31–35
14. Class of Correcting Codes for Errors With a Lattice Configuration
    
    Probl. Peredachi Inf., 12:3 (1976),  3–12
15. An Upper Bound on the Volume of $q$-ary Codes
    
    Probl. Peredachi Inf., 11:3 (1975),  14–20