default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVyacheslav V. Prelov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j30]Vyacheslav V. Prelov:
On One Extremal Problem for Mutual Information. Probl. Inf. Transm. 58(3): 217-230 (2022)- [j29]Vyacheslav V. Prelov:
Coupling of Several Random Variables. Probl. Inf. Transm. 58(4): 300-305 (2022) - 2021
- [j28]Vyacheslav V. Prelov:
The f-Divergence and Coupling of Probability Distributions. Probl. Inf. Transm. 57(1): 54-69 (2021) - [j27]Vyacheslav V. Prelov:
On the Maximum f-Divergence of Probability Distributions Given the Value of Their Coupling. Probl. Inf. Transm. 57(4): 321-330 (2021) - 2020
- [j26]Vyacheslav V. Prelov:
On the Maximum Values of f-Divergence and Rényi Divergence under a Given Variational Distance. Probl. Inf. Transm. 56(1): 1-12 (2020) - 2019
- [j25]Vyacheslav V. Prelov:
On Extreme Values of the Rényi Entropy under Coupling of Probability Distributions. Probl. Inf. Transm. 55(1): 46-52 (2019) - [j24]Vyacheslav V. Prelov:
Optimal Upper Bounds for the Divergence of Finite-Dimensional Distributions under a Given Variational Distance. Probl. Inf. Transm. 55(3): 218-225 (2019) - 2018
- [j23]Vyacheslav V. Prelov:
On Some Optimization Problems for the Rényi Divergence. Probl. Inf. Transm. 54(3): 229-244 (2018) - 2017
- [j22]Vyacheslav V. Prelov:
On coupling of probability distributions and estimating the divergence through variation. Probl. Inf. Transm. 53(3): 215-221 (2017) - 2016
- [j21]Vyacheslav V. Prelov:
On some extremal problems for mutual information and entropy. Probl. Inf. Transm. 52(4): 319-328 (2016) - 2015
- [j20]Vyacheslav V. Prelov:
Coupling of probability distributions and an extremal problem for the divergence. Probl. Inf. Transm. 51(2): 192-199 (2015) - 2014
- [j19]Vyacheslav V. Prelov:
On one extreme value problem for entropy and error probability. Probl. Inf. Transm. 50(3): 203-216 (2014) - 2013
- [j18]Vyacheslav V. Prelov:
On computation of entropy of an ellipsoid in a Hamming space. Probl. Inf. Transm. 49(1): 1-14 (2013) - 2011
- [j17]Vyacheslav V. Prelov:
Generalization of a Pinsker problem. Probl. Inf. Transm. 47(2): 98-116 (2011) - 2010
- [j16]Vyacheslav V. Prelov:
On computation of information via variation and inequalities for the entropy function. Probl. Inf. Transm. 46(2): 122-126 (2010) - 2009
- [j15]Vyacheslav V. Prelov, Edward C. van der Meulen:
Remark on "On Error-free Filtering of Finite-State Singular Processes under Dependent Distortions" published in Probl. Peredachi Inf., 2007, no. 4. Probl. Inf. Transm. 45(2): 191 (2009) - [j14]Vyacheslav V. Prelov:
Mutual information of several random variables and its estimation via variation. Probl. Inf. Transm. 45(4): 295-308 (2009) - 2008
- [j13]Vyacheslav V. Prelov, Edward C. van der Meulen:
Mutual information, variation, and Fano's inequality. Probl. Inf. Transm. 44(3): 185-197 (2008) - 2007
- [j12]Vyacheslav V. Prelov:
On inequalities between mutual information and variation. Probl. Inf. Transm. 43(1): 12-22 (2007) - [j11]Vyacheslav V. Prelov, Edward C. van der Meulen:
On error-free filtering of finite-state singular processes under dependent distortions. Probl. Inf. Transm. 43(4): 271-279 (2007) - 2005
- [j10]Ilya Dumer
, Mark S. Pinsker, Vyacheslav V. Prelov:
On the thinnest coverings of spheres and ellipsoids with balls in Hamming and Euclidean spaces. Electron. Notes Discret. Math. 21: 277 (2005) - 2004
- [j9]Vyacheslav V. Prelov, Sergio Verdú:
Second-Order Asymptotics of Mutual Information. IEEE Trans. Inf. Theory 50(8): 1567-1580 (2004) - [j8]Ilya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov:
On coverings of ellipsoids in Euclidean spaces. IEEE Trans. Inf. Theory 50(10): 2348-2356 (2004) - 2003
- [j7]Vyacheslav V. Prelov, Edward C. van der Meulen:
Higher-Order Asymptotics of Mutual Information for Nonlinear Channels with Non-Gaussian Noise. Probl. Inf. Transm. 39(4): 324-340 (2003) - 2002
- [j6]Ilya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov:
Epsilon-entropy of an Ellipsoid in a Hamming Space. Probl. Inf. Transm. 38(1): 1-15 (2002) - [j5]Ilya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov:
An Optimization Problem Related to the Computation of the Epsilon-entropy of an Ellipsoid in a Hamming Space. Probl. Inf. Transm. 38(2): 99-112 (2002) - [j4]Vyacheslav V. Prelov, Edward C. van der Meulen:
On the Epsilon-entropy of One Class of Ellipsoids in a Hamming Space. Probl. Inf. Transm. 38(2): 113-125 (2002) - 1995
- [j3]Mark S. Pinsker, Vyacheslav V. Prelov, Sergio Verdú:
Sensitivity of channel capacity. IEEE Trans. Inf. Theory 41(6): 1877-1888 (1995) - 1993
- [j2]Vyacheslav V. Prelov, Edward C. van der Meulen:
An asymptotic expression for the information and capacity of a multidimensional channel with weak input signals. IEEE Trans. Inf. Theory 39(5): 1728-1735 (1993) - 1987
- [j1]Kristien de Bruyn, Vyacheslav V. Prelov, Edward C. van der Meulen:
Reliable transmission of two correlated sources over an asymmetric multiple-access channel. IEEE Trans. Inf. Theory 33(5): 716-718 (1987)
Conference and Workshop Papers
- 2007
- [c3]Vyacheslav V. Prelov:
On Relationship between Mutual Information and Variation. ISIT 2007: 51-55 - 2006
- [c2]Ilya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov:
On the Thinnest Coverings of Spheres and Ellipsoids with Balls in Hamming and Euclidean Spaces. GTIT-C 2006: 898-925 - 2004
- [c1]Ilya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov:
On the thinnest coverings of ellipsoids. ISIT 2004: 521
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
