Blinovskii Vladimir Markovich

Publications in Math-Net.Ru

1. Proof of Brouwer's Conjecture (BC) for all graphs with number of vertices $n>n_0$ assuming that BC holds for $n\leq n_0$ for some $n_0 \leq 10^{24}$
   
   Russian Universities Reports. Mathematics, 30:150 (2025),  110–127
2. Fractional matchings in hypergraphs
   
   Probl. Peredachi Inf., 51:1 (2015),  29–35
3. Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture
   
   Probl. Peredachi Inf., 50:4 (2014),  43–54
4. Proof of two conjectures on correlation inequalities for one class of monotone functions
   
   Probl. Peredachi Inf., 50:3 (2014),  87–92
5. A remark on the problem of nonnegative $k$-subset sums
   
   Probl. Peredachi Inf., 48:4 (2012),  56–61
6. Proof of one inequality in identification theory
   
   Probl. Peredachi Inf., 48:2 (2012),  110–112
7. Remark on one problem in extremal combinatorics
   
   Probl. Peredachi Inf., 48:1 (2012),  80–82
8. Remark on the reliability function of a symmetric channel under list decoding
   
   Probl. Peredachi Inf., 47:2 (2011),  3–6
9. Intersection theorem for finite permutations
   
   Probl. Peredachi Inf., 47:1 (2011),  40–53
10. BSC reliability function under list decoding
    
    Probl. Peredachi Inf., 46:4 (2010),  3–13
11. A proof of one correlation inequality
    
    Probl. Peredachi Inf., 45:3 (2009),  79–84
12. Plotkin bound generalization to the case of multiple packings
    
    Probl. Peredachi Inf., 45:1 (2009),  3–7
13. On the Convexity of One Coding-Theory Function
    
    Probl. Peredachi Inf., 44:1 (2008),  38–44
14. Random Sphere Packing
    
    Probl. Peredachi Inf., 41:4 (2005),  23–35
15. Code Bounds for Multiple Packings over a Nonbinaxy Finite Alphabet
    
    Probl. Peredachi Inf., 41:1 (2005),  28–38
16. About the number of step functions with restrictions
    
    Teor. Veroyatnost. i Primenen., 50:4 (2005),  625–651
17. Large Deviations in Quantum Information Theory
    
    Probl. Peredachi Inf., 39:4 (2003),  63–70
18. Size of the Largest Antichain in a Partition Poset
    
    Probl. Peredachi Inf., 38:4 (2002),  113–120
19. Random Young Diagram, Variational Method, and Related Problems
    
    Probl. Peredachi Inf., 38:2 (2002),  33–43
20. New Approach to Estimation of the Decoding Error Probability
    
    Probl. Peredachi Inf., 38:1 (2002),  19–23
21. Error Probability Exponent of List Decoding at Low Rates
    
    Probl. Peredachi Inf., 37:4 (2001),  3–14
22. Uniform Estimate for a Spectrum of a Linear Code
    
    Probl. Peredachi Inf., 37:3 (2001),  3–5
23. Large Deviation Principle for Poisson Random Variables and Young Diagrams
    
    Probl. Peredachi Inf., 37:1 (2001),  72–77
24. Large Deviations of the Shape of a Random Young Diagram with the Bell Distribution
    
    Probl. Peredachi Inf., 36:4 (2000),  128–133
25. Large Deviation Principle for the Border of a Random Young Diagram
    
    Probl. Peredachi Inf., 35:1 (1999),  61–74
26. Estimate for the Probability of Undetected Error
    
    Probl. Peredachi Inf., 32:2 (1996),  3–9
27. Capacity of the Arbitrarily Varying Channel under List Decoding
    
    Probl. Peredachi Inf., 31:2 (1995),  3–19
28. Lower Bound on Error Probability in Fixed-Volume List Decoding
    
    Probl. Peredachi Inf., 27:4 (1991),  17–33
29. Covering the Hamming Space with Sets Translated by Vectors of a Linear Code
    
    Probl. Peredachi Inf., 26:3 (1990),  21–26
30. Asymptotically Exact Uniform Bounds for Spectra of Cosets of Linear Codes
    
    Probl. Peredachi Inf., 26:1 (1990),  99–103
31. Lower Asymptotic Bound on the Number of Linear Code Words in a Sphere of Given Radius in $(F_q)^n$
    
    Probl. Peredachi Inf., 23:2 (1987),  50–53
32. Bounds for Codes in the Case of Finite-Volume List Decoding
    
    Probl. Peredachi Inf., 22:1 (1986),  11–25


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