Vladimir M. Blinovsky

According to our database, Vladimir M. Blinovsky authored at least 40 papers between 1992 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

Asymptotic enumeration of sparse uniform hypergraphs with given degrees.

Vladimir M. Blinovsky, Catherine S. Greenhill

Eur. J. Comb., 2016

Proof of tightness of Varshamov - Gilbert bound for binary codes.

Vladimir M. Blinovsky

CoRR, 2016

Asymptotic Enumeration of Sparse Uniform Linear Hypergraphs with Given Degrees.

Vladimir M. Blinovsky, Catherine S. Greenhill

Electron. J. Comb., 2016

2015

Fractional matchings in hypergraphs.

Vladimir M. Blinovsky

Probl. Inf. Transm., 2015

2014

Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture.

Vladimir M. Blinovsky

Probl. Inf. Transm., 2014

Proof of two conjectures on correlation inequalities for one class of monotone functions.

Vladimir M. Blinovsky

Probl. Inf. Transm., 2014

2013

Classical-Quantum Arbitrarily Varying Wiretap Channel.

Vladimir M. Blinovsky, Minglai Cai

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2012

Proof of one inequality in identification theory.

Vladimir M. Blinovsky

Probl. Inf. Transm., 2012

Remark on one problem in extremal combinatorics.

Vladimir M. Blinovsky

Probl. Inf. Transm., 2012

A remark on the problem of nonnegative <i>k</i>-subset sums.

Harout K. Aydinian, Vladimir M. Blinovsky

Probl. Inf. Transm., 2012

2011

Remark on the reliability function of a symmetric channel under list decoding.

Vladimir M. Blinovsky

Probl. Inf. Transm., 2011

Intersection theorem for finite permutations.

Vladimir M. Blinovsky

Probl. Inf. Transm., 2011

Complete Intersection Problems for Finite Permutations.

Vladimir M. Blinovsky

Electron. Notes Discret. Math., 2011

New Asymptotic Bounds on the Size of Multiple Packings of the Euclidean Sphere.

Vladimir M. Blinovsky, Simon Litsyn

Discret. Comput. Geom., 2011

About the reliability function of symmetric channel under list decoding.

Vladimir M. Blinovsky

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

BSC reliability function under list decoding.

Vladimir M. Blinovsky

Probl. Inf. Transm., 2010

Weight distribution moments of random linear/coset codes.

Vladimir M. Blinovsky, Uri Erez, Simon Litsyn

Des. Codes Cryptogr., 2010

2009

A proof of one correlation inequality.

Vladimir M. Blinovsky

Probl. Inf. Transm., 2009

Plotkin bound generalization to the case of multiple packings.

Vladimir M. Blinovsky

Probl. Inf. Transm., 2009

New asymptotic bounds on the size of list codes on Euclidean sphere.

Vladimir M. Blinovsky, Simon Litsyn

Proceedings of the IEEE International Symposium on Information Theory, 2009

Generalization of Plotkin bound to the case of multiple packing.

Vladimir M. Blinovsky

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

On the convexity of one coding-theory function.

Vladimir M. Blinovsky

Probl. Inf. Transm., 2008

About convexity of one function from coding theory.

Vladimir M. Blinovsky

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Lectures on advances in combinatorics.

Rudolf Ahlswede, Vladimir M. Blinovsky

Universitext, Springer, ISBN: 978-3-540-78601-6, 2008

2007

Classical Capacity of Classical-Quantum Arbitrarily Varying Channels.

Rudolf Ahlswede, Vladimir M. Blinovsky

IEEE Trans. Inf. Theory, 2007

2006

Maximal sets of numbers not containing <i>k</i>+1 pairwise coprimes and having divisors from a specified set of primes.

Rudolf Ahlswede, Vladimir M. Blinovsky

J. Comb. Theory, Ser. A, 2006

Capacity of Quantum Arbitrarily Varying Channels.

Rudolf Ahlswede, Vladimir M. Blinovsky

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Two Problems from Coding Theory.

Vladimir M. Blinovsky

Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

2005

Random Sphere Packing.

Vladimir M. Blinovsky

Probl. Inf. Transm., 2005

Code bounds for multiple packings over a nonbinary finite alphabet.

Vladimir M. Blinovsky

Probl. Inf. Transm., 2005

Multiple Packing in Sum-type Metric Spaces.

Rudolf Ahlswede, Vladimir M. Blinovsky

Electron. Notes Discret. Math., 2005

Correlation Inequalities in Function Spaces.

Rudolf Ahlswede, Vladimir M. Blinovsky

Electron. Notes Discret. Math., 2005

2003

Large Deviations in Quantum Information Theory.

Rudolf Ahlswede, Vladimir M. Blinovsky

Probl. Inf. Transm., 2003

2002

Size of the Largest Antichain in a Partition Poset.

Vladimir M. Blinovsky, Lawrence H. Harper

Probl. Inf. Transm., 2002

Random Young Diagram, Variational Method, and Related Problems.

Vladimir M. Blinovsky

Probl. Inf. Transm., 2002

New Approach to Estimation of the Decoding Error Probability.

Vladimir M. Blinovsky

Probl. Inf. Transm., 2002

2001

Error Probability Exponent of List Decoding at Low Rates.

Vladimir M. Blinovsky

Probl. Inf. Transm., 2001

Uniform Estimate for a Spectrum of a Linear Code.

Vladimir M. Blinovsky

Probl. Inf. Transm., 2001

Large Deviation Principle for Poisson Random Variables and Young Diagrams.

Vladimir M. Blinovsky

Probl. Inf. Transm., 2001

1992

List decoding.

Vladimir M. Blinovsky

Discret. Math., 1992