List decoding. - Vladimir M. Blinovsky (Discret. Math., 1992)

Large Deviation Principle for Poisson Random Variables and Young Diagrams. - Vladimir M. Blinovsky (Probl. Inf. Transm., 2001)

Uniform Estimate for a Spectrum of a Linear Code. - Vladimir M. Blinovsky (Probl. Inf. Transm., 2001)

Error Probability Exponent of List Decoding at Low Rates. - Vladimir M. Blinovsky (Probl. Inf. Transm., 2001)

New Approach to Estimation of the Decoding Error Probability. - Vladimir M. Blinovsky (Probl. Inf. Transm., 2002)

Random Young Diagram, Variational Method, and Related Problems. - Vladimir M. Blinovsky (Probl. Inf. Transm., 2002)

Size of the Largest Antichain in a Partition Poset. - Vladimir M. Blinovsky; Lawrence H. Harper (Probl. Inf. Transm., 2002)

Large Deviations in Quantum Information Theory. - Rudolf Ahlswede; Vladimir M. Blinovsky (Probl. Inf. Transm., 2003)

Correlation Inequalities in Function Spaces. - Rudolf Ahlswede; Vladimir M. Blinovsky (Electron. Notes Discret. Math., 2005)

Code bounds for multiple packings over a nonbinary finite alphabet. - Vladimir M. Blinovsky (Probl. Inf. Transm., 2005)

Random Sphere Packing. - Vladimir M. Blinovsky (Probl. Inf. Transm., 2005)

Two Problems from Coding Theory. - Vladimir M. Blinovsky (GTIT-C, 2006)

Capacity of Quantum Arbitrarily Varying Channels. - Rudolf Ahlswede; Vladimir M. Blinovsky (ISIT, 2006)

Maximal sets of numbers not containing k+1 pairwise coprimes and having divisors from a specified set of primes. - Rudolf Ahlswede; Vladimir M. Blinovsky (J. Comb. Theory A, 2006)

Classical Capacity of Classical-Quantum Arbitrarily Varying Channels. - Rudolf Ahlswede; Vladimir M. Blinovsky (IEEE Trans. Inf. Theory, 2007)

Lectures on advances in combinatorics. - Rudolf Ahlswede; Vladimir M. Blinovsky (Springer, 2008)

About convexity of one function from coding theory. - Vladimir M. Blinovsky (ISIT, 2008)

Multiple packing in sum-type metric spaces. - Rudolf Ahlswede; Vladimir M. Blinovsky (Discret. Appl. Math., 2008)

On the convexity of one coding-theory function. - Vladimir M. Blinovsky (Probl. Inf. Transm., 2008)

Generalization of Plotkin bound to the case of multiple packing. - Vladimir M. Blinovsky (ISIT, 2009)

New asymptotic bounds on the size of list codes on Euclidean sphere. - Vladimir M. Blinovsky; Simon Litsyn (ISIT, 2009)

Plotkin bound generalization to the case of multiple packings. - Vladimir M. Blinovsky (Probl. Inf. Transm., 2009)

A proof of one correlation inequality. - Vladimir M. Blinovsky (Probl. Inf. Transm., 2009)

Weight distribution moments of random linear/coset codes. - Vladimir M. Blinovsky; Uri Erez; Simon Litsyn (Des. Codes Cryptogr., 2010)

BSC reliability function under list decoding. - Vladimir M. Blinovsky (Probl. Inf. Transm., 2010)

About the reliability function of symmetric channel under list decoding. - Vladimir M. Blinovsky (ISIT, 2011)

New Asymptotic Bounds on the Size of Multiple Packings of the Euclidean Sphere. - Vladimir M. Blinovsky; Simon Litsyn (Discret. Comput. Geom., 2011)

Complete Intersection Problems for Finite Permutations. - Vladimir M. Blinovsky (Electron. Notes Discret. Math., 2011)

Intersection theorem for finite permutations. - Vladimir M. Blinovsky (Probl. Inf. Transm., 2011)

Remark on the reliability function of a symmetric channel under list decoding. - Vladimir M. Blinovsky (Probl. Inf. Transm., 2011)

A remark on the problem of nonnegative k-subset sums. - Harout K. Aydinian; Vladimir M. Blinovsky (Probl. Inf. Transm., 2012)

Remark on one problem in extremal combinatorics. - Vladimir M. Blinovsky (Probl. Inf. Transm., 2012)

Proof of one inequality in identification theory. - Vladimir M. Blinovsky (Probl. Inf. Transm., 2012)

Classical-Quantum Arbitrarily Varying Wiretap Channel. - Vladimir M. Blinovsky; Minglai Cai (Information Theory, Combinatorics, and Search Theory, 2013)

Proof of two conjectures on correlation inequalities for one class of monotone functions. - Vladimir M. Blinovsky (Probl. Inf. Transm., 2014)

Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture. - Vladimir M. Blinovsky (Probl. Inf. Transm., 2014)

Fractional matchings in hypergraphs. - Vladimir M. Blinovsky (Probl. Inf. Transm., 2015)

Asymptotic Enumeration of Sparse Uniform Linear Hypergraphs with Given Degrees. - Vladimir M. Blinovsky; Catherine S. Greenhill (Electron. J. Comb., 2016)

Proof of tightness of Varshamov - Gilbert bound for binary codes. - Vladimir M. Blinovsky (CoRR, 2016)

Asymptotic enumeration of sparse uniform hypergraphs with given degrees. - Vladimir M. Blinovsky; Catherine S. Greenhill (Eur. J. Comb., 2016)

Complete Intersection Theorem and Complete Nontrivial Intersection Theorem for a System of Set Partitions. - Vladimir M. Blinovsky (Information Theory and Related Fields, 2025)

The Solution to the Complete Nontrivial Cycle Intersection Problem for Permutations. - Vladimir M. Blinovsky; Llohann D. Speranca (Information Theory and Related Fields, 2025)