Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir M. Blinovsky
Person information
- affiliation: University of São Paulo, SP, Brazil
- affiliation: Russian Academy of Sciences, Kharkevich Institute for Information Transmission Problems, Moscow, Russia
- affiliation (former): Bielefeld University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j32]Vladimir M. Blinovsky, Catherine S. Greenhill:
Asymptotic Enumeration of Sparse Uniform Linear Hypergraphs with Given Degrees. Electron. J. Comb. 23(3): 3 (2016)- [j31]Vladimir M. Blinovsky, Catherine S. Greenhill:
Asymptotic enumeration of sparse uniform hypergraphs with given degrees. Eur. J. Comb. 51: 287-296 (2016) - [i2]Vladimir M. Blinovsky:
Proof of tightness of Varshamov - Gilbert bound for binary codes. CoRR abs/1606.01592 (2016) - 2015
- [j30]Vladimir M. Blinovsky:
Fractional matchings in hypergraphs. Probl. Inf. Transm. 51(1): 25-30 (2015) - 2014
- [j29]Vladimir M. Blinovsky:
Proof of two conjectures on correlation inequalities for one class of monotone functions. Probl. Inf. Transm. 50(3): 280-284 (2014) - [j28]Vladimir M. Blinovsky:
Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture. Probl. Inf. Transm. 50(4): 340-349 (2014) - 2013
- [c8]Vladimir M. Blinovsky, Minglai Cai:
Classical-Quantum Arbitrarily Varying Wiretap Channel. Information Theory, Combinatorics, and Search Theory 2013: 234-246 - 2012
- [j27]Vladimir M. Blinovsky:
Remark on one problem in extremal combinatorics. Probl. Inf. Transm. 48(1): 70-71 (2012) - [j26]Vladimir M. Blinovsky:
Proof of one inequality in identification theory. Probl. Inf. Transm. 48(2): 182-184 (2012) - [j25]Harout K. Aydinian, Vladimir M. Blinovsky:
A remark on the problem of nonnegative k-subset sums. Probl. Inf. Transm. 48(4): 347-351 (2012) - [i1]Vladimir M. Blinovsky, Minglai Cai:
Classical-Quantum Arbitrarily Varying Wiretap Channel. CoRR abs/1208.1151 (2012) - 2011
- [j24]Vladimir M. Blinovsky, Simon Litsyn:
New Asymptotic Bounds on the Size of Multiple Packings of the Euclidean Sphere. Discret. Comput. Geom. 46(4): 626-635 (2011) - [j23]Vladimir M. Blinovsky:
Complete Intersection Problems for Finite Permutations. Electron. Notes Discret. Math. 38: 147-148 (2011) - [j22]Vladimir M. Blinovsky:
Intersection theorem for finite permutations. Probl. Inf. Transm. 47(1): 34 (2011) - [j21]Vladimir M. Blinovsky:
Remark on the reliability function of a symmetric channel under list decoding. Probl. Inf. Transm. 47(2): 85-88 (2011) - [c7]Vladimir M. Blinovsky:
About the reliability function of symmetric channel under list decoding. ISIT 2011: 61-63 - [e2]Alexander Kuleshov, Vladimir M. Blinovsky, Anthony Ephremides:
2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russia, July 31 - August 5, 2011. IEEE 2011, ISBN 978-1-4577-0596-0 [contents] - 2010
- [j20]Vladimir M. Blinovsky, Uri Erez, Simon Litsyn:
Weight distribution moments of random linear/coset codes. Des. Codes Cryptogr. 57(2): 127-138 (2010) - [j19]Vladimir M. Blinovsky:
BSC reliability function under list decoding. Probl. Inf. Transm. 46(4): 273-282 (2010)
2000 – 2009
- 2009
- [j18]Vladimir M. Blinovsky:
Plotkin bound generalization to the case of multiple packings. Probl. Inf. Transm. 45(1): 1-4 (2009) - [j17]Vladimir M. Blinovsky:
A proof of one correlation inequality. Probl. Inf. Transm. 45(3): 264 (2009) - [c6]Vladimir M. Blinovsky, Simon Litsyn:
New asymptotic bounds on the size of list codes on Euclidean sphere. ISIT 2009: 1244-1247 - [c5]Vladimir M. Blinovsky:
Generalization of Plotkin bound to the case of multiple packing. ISIT 2009: 2048-2050 - 2008
- [b1]Rudolf Ahlswede, Vladimir M. Blinovsky:
Lectures on advances in combinatorics. Universitext, Springer 2008, ISBN 978-3-540-78601-6, pp. I-XIII, 1-314 - [j16]Rudolf Ahlswede, Vladimir M. Blinovsky:
Multiple packing in sum-type metric spaces. Discret. Appl. Math. 156(9): 1469-1477 (2008) - [j15]Vladimir M. Blinovsky:
On the convexity of one coding-theory function. Probl. Inf. Transm. 44(1): 34-39 (2008) - [c4]Vladimir M. Blinovsky:
About convexity of one function from coding theory. ISIT 2008: 1973-1976 - 2007
- [j14]Rudolf Ahlswede, Vladimir M. Blinovsky:
Classical Capacity of Classical-Quantum Arbitrarily Varying Channels. IEEE Trans. Inf. Theory 53(2): 526-533 (2007) - 2006
- [j13]Rudolf Ahlswede, Vladimir M. Blinovsky:
Maximal sets of numbers not containing k+1 pairwise coprimes and having divisors from a specified set of primes. J. Comb. Theory A 113(8): 1621-1628 (2006) - [c3]Rudolf Ahlswede, Vladimir M. Blinovsky:
Correlation Inequalities in Function Spaces. GTIT-C 2006: 572-577 - [c2]Vladimir M. Blinovsky:
Two Problems from Coding Theory. GTIT-C 2006: 1075 - [c1]Rudolf Ahlswede, Vladimir M. Blinovsky:
Capacity of Quantum Arbitrarily Varying Channels. ISIT 2006: 456-458 - [e1]Rudolf Ahlswede, Lars Bäumer, Ning Cai, Harout K. Aydinian, Vladimir M. Blinovsky, Christian Deppe, Haik Mashurian:
General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science 4123, Springer 2006, ISBN 3-540-46244-9 [contents] - 2005
- [j12]Rudolf Ahlswede, Vladimir M. Blinovsky:
Correlation Inequalities in Function Spaces. Electron. Notes Discret. Math. 21: 125-127 (2005) - [j11]Rudolf Ahlswede, Vladimir M. Blinovsky:
Multiple Packing in Sum-type Metric Spaces. Electron. Notes Discret. Math. 21: 129-131 (2005) - [j10]Vladimir M. Blinovsky:
Code bounds for multiple packings over a nonbinary finite alphabet. Probl. Inf. Transm. 41(1): 23-32 (2005) - [j9]Vladimir M. Blinovsky:
Random Sphere Packing. Probl. Inf. Transm. 41(4): 319-330 (2005) - 2003
- [j8]Rudolf Ahlswede, Vladimir M. Blinovsky:
Large Deviations in Quantum Information Theory. Probl. Inf. Transm. 39(4): 373-379 (2003) - 2002
- [j7]Vladimir M. Blinovsky:
New Approach to Estimation of the Decoding Error Probability. Probl. Inf. Transm. 38(1): 16-19 (2002) - [j6]Vladimir M. Blinovsky:
Random Young Diagram, Variational Method, and Related Problems. Probl. Inf. Transm. 38(2): 126-135 (2002) - [j5]Vladimir M. Blinovsky, Lawrence H. Harper:
Size of the Largest Antichain in a Partition Poset. Probl. Inf. Transm. 38(4): 347-353 (2002) - 2001
- [j4]Vladimir M. Blinovsky:
Large Deviation Principle for Poisson Random Variables and Young Diagrams. Probl. Inf. Transm. 37(1): 65-69 (2001) - [j3]Vladimir M. Blinovsky:
Uniform Estimate for a Spectrum of a Linear Code. Probl. Inf. Transm. 37(3): 187-189 (2001) - [j2]Vladimir M. Blinovsky:
Error Probability Exponent of List Decoding at Low Rates. Probl. Inf. Transm. 37(4): 277-287 (2001)
1990 – 1999
- 1992
- [j1]Vladimir M. Blinovsky:
List decoding. Discret. Math. 106-107: 45-51 (1992)
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-06-10 20:31 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:
