RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 
Prelov, Vyacheslav Valer'evich

Statistics Math-Net.Ru
Total publications: 48
Scientific articles: 42
Presentations: 4

Number of views:
This page:1439
Abstract pages:11847
Full texts:3672
References:751
E-mail:

http://www.mathnet.ru/eng/person17337
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/217745

Publications in Math-Net.Ru
2019
1. V. V. Prelov, “Optimal upper bounds for the divergence of finite-dimensional distributions under a given variational distance”, Probl. Peredachi Inf., 55:3 (2019),  21–29  mathnet  elib; Problems Inform. Transmission, 55:3 (2019), 218–225  isi  scopus
2. V. V. Prelov, “On extreme values of the Rényi entropy under coupling of probability distributions”, Probl. Peredachi Inf., 55:1 (2019),  51–58  mathnet  elib; Problems Inform. Transmission, 55:1 (2019), 46–52  isi  scopus
2018
3. V. V. Prelov, “On some optimization problems for the Rényi divergence”, Probl. Peredachi Inf., 54:3 (2018),  36–53  mathnet  elib; Problems Inform. Transmission, 54:3 (2018), 229–244  isi  scopus
2017
4. V. V. Prelov, “On coupling of probability distributions and estimating the divergence through variation”, Probl. Peredachi Inf., 53:3 (2017),  16–22  mathnet  elib; Problems Inform. Transmission, 53:3 (2017), 215–221  isi  scopus
2016
5. V. V. Prelov, “On some extremal problems for mutual information and entropy”, Probl. Peredachi Inf., 52:4 (2016),  3–13  mathnet  elib; Problems Inform. Transmission, 52:4 (2016), 319–328  isi  scopus
2015
6. V. V. Prelov, “Coupling of probability distributions and an extremal problem for the divergence”, Probl. Peredachi Inf., 51:2 (2015),  114–121  mathnet  elib; Problems Inform. Transmission, 51:2 (2015), 192–199  isi  scopus
2014
7. V. V. Prelov, “On one extreme value problem for entropy and error probability”, Probl. Peredachi Inf., 50:3 (2014),  3–18  mathnet; Problems Inform. Transmission, 50:3 (2014), 203–216  isi  scopus
2013
8. V. V. Prelov, “On computation of entropy of an ellipsoid in a Hamming space”, Probl. Peredachi Inf., 49:1 (2013),  3–18  mathnet; Problems Inform. Transmission, 49:1 (2013), 1–14  isi  scopus
2011
9. V. V. Prelov, “Generalization of a Pinsker problem”, Probl. Peredachi Inf., 47:2 (2011),  17–37  mathnet  mathscinet; Problems Inform. Transmission, 47:2 (2011), 98–116  isi  scopus
2010
10. V. V. Prelov, “On computation of information via variation and inequalities for the entropy function”, Probl. Peredachi Inf., 46:2 (2010),  24–29  mathnet  mathscinet; Problems Inform. Transmission, 46:2 (2010), 122–126  isi  scopus
2009
11. V. V. Prelov, “Mutual information of several random variables and its estimation via variation”, Probl. Peredachi Inf., 45:4 (2009),  3–17  mathnet  mathscinet  zmath; Problems Inform. Transmission, 45:4 (2009), 295–308  isi  scopus
2008
12. V. V. Prelov, E. C. van der Meulen, “Mutual Information, Variation, and Fano's Inequality”, Probl. Peredachi Inf., 44:3 (2008),  19–32  mathnet  mathscinet  zmath; Problems Inform. Transmission, 44:3 (2008), 185–197  isi  scopus
2007
13. V. V. Prelov, E. C. van der Meulen, “On Error-free Filtering of Finite-State Singular Processes under Dependent Distortions”, Probl. Peredachi Inf., 43:4 (2007),  3–12  mathnet  mathscinet  zmath  elib; Problems Inform. Transmission, 43:4 (2007), 271–279  isi  elib  scopus
14. V. V. Prelov, “On Inequalities between Information and Variation”, Probl. Peredachi Inf., 43:1 (2007),  15–27  mathnet  mathscinet; Problems Inform. Transmission, 43:1 (2007), 12–22  isi  scopus
2003
15. E. C. van der Meulen, V. V. Prelov, “High-Order Asymptotics of the Mutual Information in Nonlinear Non-Gaussian-Noise Channels”, Probl. Peredachi Inf., 39:4 (2003),  10–29  mathnet  mathscinet  zmath; Problems Inform. Transmission, 39:4 (2003), 324–340
2002
16. V. V. Prelov, E. van der Meulen, “On the Epsilon-entropy of One Class of Ellipsoids in a Hamming Space”, Probl. Peredachi Inf., 38:2 (2002),  19–32  mathnet  mathscinet  zmath; Problems Inform. Transmission, 38:2 (2002), 113–125
17. I. I. Dumer, M. S. Pinsker, V. V. Prelov, “An Optimization Problem Related to the Computation of the Epsilon-entropy of an Ellipsoid in a Hamming Space”, Probl. Peredachi Inf., 38:2 (2002),  3–18  mathnet  mathscinet  zmath; Problems Inform. Transmission, 38:2 (2002), 99–112
18. I. I. Dumer, M. S. Pinsker, V. V. Prelov, “Epsilon-entropy of an Ellipsoid in a Hamming Space”, Probl. Peredachi Inf., 38:1 (2002),  3–18  mathnet  mathscinet  zmath; Problems Inform. Transmission, 38:1 (2002), 1–15
2000
19. M. S. Pinsker, V. V. Prelov, “On Error-Free Filtering of Singular Processes under Nonstationary Distortions”, Probl. Peredachi Inf., 36:4 (2000),  89–97  mathnet  mathscinet  zmath; Problems Inform. Transmission, 36:4 (2000), 362–369
20. M. S. Pinsker, V. V. Prelov, E. C. van der Meulen, “Information Rate in Memoryless Channels for a Slowly Varying Markov Signal”, Probl. Peredachi Inf., 36:3 (2000),  29–38  mathnet  mathscinet  zmath; Problems Inform. Transmission, 36:3 (2000), 220–229
1999
21. M. S. Pinsker, V. V. Prelov, E. C. van der Meulen, “Stationary Channels with a Random Parameter Which Is a Completely Singular Process”, Probl. Peredachi Inf., 35:1 (1999),  3–12  mathnet  mathscinet  zmath; Problems Inform. Transmission, 35:1 (1999), 1–9
1998
22. M. S. Pinsker, V. V. Prelov, “Upper and Lower Bounds and Asymptotics of Optimal Filtering Error of a Stationary Process with a Small Information Rate”, Probl. Peredachi Inf., 34:4 (1998),  23–38  mathnet  mathscinet  zmath; Problems Inform. Transmission, 34:4 (1998), 309–321
23. M. S. Pinsker, V. V. Prelov, “Error-Free Filtering of an Entropy-Singular Signal under Independent Distortions”, Probl. Peredachi Inf., 34:3 (1998),  3–6  mathnet  zmath; Problems Inform. Transmission, 34:3 (1998), 207–209
24. M. S. Pinsker, V. V. Prelov, E. C. van der Meulen, “Information Rates in Certain Stationary Non-Gaussian Channels in Weak-Signal Transmission”, Probl. Peredachi Inf., 34:1 (1998),  3–17  mathnet  mathscinet  zmath; Problems Inform. Transmission, 34:1 (1998), 1–13
1997
25. M. S. Pinsker, V. V. Prelov, S. Verdú, “Sensitivity of the $\varepsilon$-Entropy of Stationary Continuous-Time Gaussian Processes”, Probl. Peredachi Inf., 33:2 (1997),  3–25  mathnet  mathscinet  zmath; Problems Inform. Transmission, 33:2 (1997), 95–113
26. M. Sh. Pinsker, V. V. Prelov, “On error-free filtering of some stationary processes”, Uspekhi Mat. Nauk, 52:2(314) (1997),  109–118  mathnet  mathscinet  zmath; Russian Math. Surveys, 52:2 (1997), 349–358  isi  scopus
1995
27. M. S. Pinsker, V. V. Prelov, “Optimal Filtering of a Gaussian Signal Against a Background of Almost Gaussian Noise”, Probl. Peredachi Inf., 31:4 (1995),  3–21  mathnet  mathscinet  zmath; Problems Inform. Transmission, 31:4 (1995), 295–311
28. V. V. Prelov, E. C. van der Meulen, “Asymptotics of Fisher Information Under Weak Perturbation”, Probl. Peredachi Inf., 31:1 (1995),  17–27  mathnet  mathscinet  zmath; Problems Inform. Transmission, 3:1 (1995), 14–22
1994
29. M. S. Pinsker, V. V. Prelov, “Information Rates in Stationary Gaussian Channels in Weak Signal Transmission”, Probl. Peredachi Inf., 30:4 (1994),  3–11  mathnet  mathscinet  zmath; Problems Inform. Transmission, 30:4 (1994), 291–298
1988
30. V. V. Prelov, “Capacity of Communication Channels with Almost Gaussian Noise”, Teor. Veroyatnost. i Primenen., 33:3 (1988),  433–452  mathnet  mathscinet  zmath; Theory Probab. Appl., 33:3 (1988), 405–422  isi
1986
31. V. V. Prelov, “Zero-Error Capacity of Memoryless Channels with Weak Input Signals”, Probl. Peredachi Inf., 22:2 (1986),  27–33  mathnet  mathscinet  zmath; Problems Inform. Transmission, 22:1 (1986), 98–104
1984
32. V. V. Prelov, “Transmission over a Multiple-Access Channel with a Special Source Hierarchy”, Probl. Peredachi Inf., 20:4 (1984),  3–10  mathnet  mathscinet  zmath; Problems Inform. Transmission, 20:4 (1984), 233–239
1982
33. L. A. Bassalygo, M. S. Pinsker, V. V. Prelov, “Zero-Error Capacity for Deterministic Multiple-Access Channels with Common Information”, Probl. Peredachi Inf., 18:1 (1982),  3–11  mathnet  zmath; Problems Inform. Transmission, 18:1 (1982), 1–8
1981
34. L. A. Bassalygo, V. V. Prelov, “Zero-Error Capacity of Continuous Memoryless Channels with a Small Input Signal”, Probl. Peredachi Inf., 17:1 (1981),  5–16  mathnet  mathscinet  zmath; Problems Inform. Transmission, 17:1 (1981), 1–9
1980
35. V. V. Prelov, “Asymptotic Behavior of the Capacity of a Continuous Channel with Large Smooth Noise”, Probl. Peredachi Inf., 16:2 (1980),  3–17  mathnet  mathscinet  zmath; Problems Inform. Transmission, 16:2 (1980), 81–92
1979
36. R. L. Dobrushin, V. V. Prelov, “Asymptotic Approach to the Investigation of Message Switching Networks of Linear Structure with a Large Number of Nodes”, Probl. Peredachi Inf., 15:1 (1979),  61–73  mathnet  mathscinet  zmath; Problems Inform. Transmission, 15:1 (1979), 46–55
1978
37. S. I. Gel'fand, V. V. Prelov, “Multiple-user communication”, Itogi Nauki i Tekhniki. Ser. Teor. Veroyatn. Mat. Stat. Teor. Kibern., 15 (1978),  123–162  mathnet  mathscinet  zmath; J. Soviet Math., 13:3 (1980), 386–408
1972
38. V. V. Prelov, “Asymptotic Behavior of the Capacity of a Continuous Channel with Large Nonadditive Noise”, Probl. Peredachi Inf., 8:4 (1972),  22–27  mathnet  mathscinet  zmath; Problems Inform. Transmission, 8:4 (1972), 285–289
1970
39. V. V. Prelov, “Asymptotic Behavior of the Capacity of a Continuous Channel with a Large Amount of Noise”, Probl. Peredachi Inf., 6:2 (1970),  40–57  mathnet  mathscinet  zmath; Problems Inform. Transmission, 6:2 (1970), 122–135
1969
40. V. V. Prelov, “The Asymptotic Channel Capacity for a Continuous Channel with Small Additive Noise”, Probl. Peredachi Inf., 5:2 (1969),  31–36  mathnet  zmath; Problems Inform. Transmission, 5:2 (1969), 23–27
1967
41. V. V. Prelov, “Asymptotic Transmission Capacity of Channels with a Countable Alphabet and Application to Asynchronous Channels”, Probl. Peredachi Inf., 3:2 (1967),  22–36  mathnet  mathscinet; Problems Inform. Transmission, 3:2 (1967), 18–29
1966
42. V. V. Prelov, “On the Asymptotic Behavior of the Transmission Capacity of Some Communication Channels”, Probl. Peredachi Inf., 2:1 (1966),  14–27  mathnet  mathscinet  zmath; Problems Inform. Transmission, 2:1 (1966), 10–21

2009
43. V. V. Prelov, E. van der Meulen, “Letters to the Editor”, Probl. Peredachi Inf., 45:2 (2009),  127  mathnet  mathscinet  zmath; Problems Inform. Transmission, 45:2 (2009), 191  isi  scopus
2004
44. 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
1997
45. V. V. Prelov, “Information theory in Dobrushin's scientific activity”, Uspekhi Mat. Nauk, 52:2(314) (1997),  9–13  mathnet  mathscinet  zmath; Russian Math. Surveys, 52:2 (1997), 245–249  isi  scopus
1996
46. L. A. Bassalygo, V. A. Malyshev, R. A. Minlos, I. A. Ovseevich, E. A. Pechersky, M. S. Pinsker, V. V. Prelov, A. N. Rybko, Yu. M. Sukhov, S. B. Shlosman, “In Memory of Roland L'vovich Dobrushin”, Probl. Peredachi Inf., 32:3 (1996),  3–24  mathnet  mathscinet  zmath; Problems Inform. Transmission, 32:3 (1996), 223–238
47. L. A. Bassalygo, S. I. Gel'fand, G. K. Golubev, R. L. Dobrushin, V. V. Prelov, Ya. G. Sinai, R. Z. Khas'minskii, A. M. Yaglom, “Review of Scientific Achievements of M. S. Pinsker”, Probl. Peredachi Inf., 32:1 (1996),  5–19  mathnet  mathscinet  zmath; Problems Inform. Transmission, 32:1 (1996), 3–14
48. B. M. Gurevich, I. A. Ibragimov, R. A. Minlos, I. A. Ovseevich, V. I. Oseledets, M. S. Pinsker, V. V. Prelov, Yu. V. Prokhorov, Ya. G. Sinai, A. S. Holevo, A. N. Shiryaev, “Roland L'vovich Dobrushin (20 July 1919 – 12 November 1995)”, Teor. Veroyatnost. i Primenen., 41:1 (1996),  164–169  mathnet  mathscinet; Theory Probab. Appl., 41:1 (1997), 132–136  isi

Presentations in Math-Net.Ru
1. О некоторых экстремальных задачах и неравенствах в теории информации
V. V. Prelov
Dobrushin Mathematics Laboratory Seminar
February 13, 2018 16:00
2. О пропускной способности некоторых каналов с многими пользователями при нулевой ошибке
V. V. Prelov
Seminar on Coding Theory
December 15, 2015 19:00
3. Склеивание вероятностных распределений и некоторые приложения
V. V. Prelov
Seminar on Coding Theory
February 24, 2015 19:00
4. О некоторых экстремальных задачах и неравенствах в теории информации
V. V. Prelov
Seminar on Coding Theory
February 11, 2014 19:00

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020