Vladimir M. Blinovsky

Affiliations:
  • University of São Paulo, SP, Brazil
  • Russian Academy of Sciences, Kharkevich Institute for Information Transmission Problems, Moscow, Russia
  • Bielefeld University, Germany (former)


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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2016
Asymptotic enumeration of sparse uniform hypergraphs with given degrees.
Eur. J. Comb., 2016

Proof of tightness of Varshamov - Gilbert bound for binary codes.
CoRR, 2016

Asymptotic Enumeration of Sparse Uniform Linear Hypergraphs with Given Degrees.
Electron. J. Comb., 2016

2015
Fractional matchings in hypergraphs.
Probl. Inf. Transm., 2015

2014
Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture.
Probl. Inf. Transm., 2014

Proof of two conjectures on correlation inequalities for one class of monotone functions.
Probl. Inf. Transm., 2014

2013
Classical-Quantum Arbitrarily Varying Wiretap Channel.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2012
Proof of one inequality in identification theory.
Probl. Inf. Transm., 2012

Remark on one problem in extremal combinatorics.
Probl. Inf. Transm., 2012

A remark on the problem of nonnegative <i>k</i>-subset sums.
Probl. Inf. Transm., 2012

2011
Remark on the reliability function of a symmetric channel under list decoding.
Probl. Inf. Transm., 2011

Intersection theorem for finite permutations.
Probl. Inf. Transm., 2011

Complete Intersection Problems for Finite Permutations.
Electron. Notes Discret. Math., 2011

New Asymptotic Bounds on the Size of Multiple Packings of the Euclidean Sphere.
Discret. Comput. Geom., 2011

About the reliability function of symmetric channel under list decoding.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
BSC reliability function under list decoding.
Probl. Inf. Transm., 2010

Weight distribution moments of random linear/coset codes.
Des. Codes Cryptogr., 2010

2009
A proof of one correlation inequality.
Probl. Inf. Transm., 2009

Plotkin bound generalization to the case of multiple packings.
Probl. Inf. Transm., 2009

New asymptotic bounds on the size of list codes on Euclidean sphere.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Generalization of Plotkin bound to the case of multiple packing.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
On the convexity of one coding-theory function.
Probl. Inf. Transm., 2008

Multiple packing in sum-type metric spaces.
Discret. Appl. Math., 2008

About convexity of one function from coding theory.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Lectures on advances in combinatorics.
Universitext, Springer, ISBN: 978-3-540-78601-6, 2008

2007
Classical Capacity of Classical-Quantum Arbitrarily Varying Channels.
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.
J. Comb. Theory A, 2006

Capacity of Quantum Arbitrarily Varying Channels.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Two Problems from Coding Theory.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

2005
Random Sphere Packing.
Probl. Inf. Transm., 2005

Code bounds for multiple packings over a nonbinary finite alphabet.
Probl. Inf. Transm., 2005

Correlation Inequalities in Function Spaces.
Electron. Notes Discret. Math., 2005

2003
Large Deviations in Quantum Information Theory.
Probl. Inf. Transm., 2003

2002
Size of the Largest Antichain in a Partition Poset.
Probl. Inf. Transm., 2002

Random Young Diagram, Variational Method, and Related Problems.
Probl. Inf. Transm., 2002

New Approach to Estimation of the Decoding Error Probability.
Probl. Inf. Transm., 2002

2001
Error Probability Exponent of List Decoding at Low Rates.
Probl. Inf. Transm., 2001

Uniform Estimate for a Spectrum of a Linear Code.
Probl. Inf. Transm., 2001

Large Deviation Principle for Poisson Random Variables and Young Diagrams.
Probl. Inf. Transm., 2001

1992
List decoding.
Discret. Math., 1992


  Loading...