Vladimir M. Blinovsky

47 papers B 6Journal 34Unranked 5

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	Complete Intersection Theorem and Complete Nontrivial Intersection Theorem for a System of Set Partitions. Information Theory and Related Fields Vladimir M. Blinovsky
2025	—	`conf`	The Solution to the Complete Nontrivial Cycle Intersection Problem for Permutations. Information Theory and Related Fields Vladimir M. Blinovsky, Llohann D. Speranca
2016	J	`jnl`	Asymptotic Enumeration of Sparse Uniform Linear Hypergraphs with Given Degrees. Electron. J. Comb. Vladimir M. Blinovsky, Catherine S. Greenhill
2016	J	`jnl`	Asymptotic enumeration of sparse uniform hypergraphs with given degrees. Eur. J. Comb. Vladimir M. Blinovsky, Catherine S. Greenhill
2016	J	`jnl`	Proof of tightness of Varshamov - Gilbert bound for binary codes. CoRR Vladimir M. Blinovsky
2015	J	`jnl`	Fractional matchings in hypergraphs. Probl. Inf. Transm. Vladimir M. Blinovsky
2014	J	`jnl`	Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture. Probl. Inf. Transm. Vladimir M. Blinovsky
2014	J	`jnl`	Proof of two conjectures on correlation inequalities for one class of monotone functions. Probl. Inf. Transm. Vladimir M. Blinovsky
2013	—	`conf`	Classical-Quantum Arbitrarily Varying Wiretap Channel. Information Theory, Combinatorics, and Search Theory Vladimir M. Blinovsky, Minglai Cai
2012	J	`jnl`	A remark on the problem of nonnegative Probl. Inf. Transm. Harout K. Aydinian, Vladimir M. Blinovsky
2012	J	`jnl`	Classical-Quantum Arbitrarily Varying Wiretap Channel CoRR Vladimir M. Blinovsky, Minglai Cai
2012	J	`jnl`	Proof of one inequality in identification theory. Probl. Inf. Transm. Vladimir M. Blinovsky
2012	J	`jnl`	Remark on one problem in extremal combinatorics. Probl. Inf. Transm. Vladimir M. Blinovsky
2011	B	`ed.`	2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russia, July 31 - August 5, 2011 ISIT Alexander Kuleshov, Vladimir M. Blinovsky, Anthony Ephremides
2011	B	`conf`	About the reliability function of symmetric channel under list decoding. ISIT Vladimir M. Blinovsky
2011	J	`jnl`	Complete Intersection Problems for Finite Permutations. Electron. Notes Discret. Math. Vladimir M. Blinovsky
2011	J	`jnl`	Intersection theorem for finite permutations. Probl. Inf. Transm. Vladimir M. Blinovsky
2011	J	`jnl`	New Asymptotic Bounds on the Size of Multiple Packings of the Euclidean Sphere. Discret. Comput. Geom. Vladimir M. Blinovsky, Simon Litsyn
2011	J	`jnl`	Remark on the reliability function of a symmetric channel under list decoding. Probl. Inf. Transm. Vladimir M. Blinovsky
2010	J	`jnl`	BSC reliability function under list decoding. Probl. Inf. Transm. Vladimir M. Blinovsky
2010	J	`jnl`	Weight distribution moments of random linear/coset codes. Des. Codes Cryptogr. Vladimir M. Blinovsky, Uri Erez, Simon Litsyn
2009	J	`jnl`	A proof of one correlation inequality. Probl. Inf. Transm. Vladimir M. Blinovsky
2009	B	`conf`	Generalization of Plotkin bound to the case of multiple packing. ISIT Vladimir M. Blinovsky
2009	B	`conf`	New asymptotic bounds on the size of list codes on Euclidean sphere. ISIT Vladimir M. Blinovsky, Simon Litsyn
2009	J	`jnl`	Plotkin bound generalization to the case of multiple packings. Probl. Inf. Transm. Vladimir M. Blinovsky
2008	B	`conf`	About convexity of one function from coding theory. ISIT Vladimir M. Blinovsky
2008	—	`book`	Lectures on advances in combinatorics. Rudolf Ahlswede, Vladimir M. Blinovsky
2008	J	`jnl`	Multiple packing in sum-type metric spaces. Discret. Appl. Math. Rudolf Ahlswede, Vladimir M. Blinovsky
2008	J	`jnl`	On the convexity of one coding-theory function. Probl. Inf. Transm. Vladimir M. Blinovsky
2007	J	`jnl`	Classical Capacity of Classical-Quantum Arbitrarily Varying Channels. IEEE Trans. Inf. Theory Rudolf Ahlswede, Vladimir M. Blinovsky
2006	B	`conf`	Capacity of Quantum Arbitrarily Varying Channels. ISIT Rudolf Ahlswede, Vladimir M. Blinovsky
2006	—	`conf`	Correlation Inequalities in Function Spaces. GTIT-C Rudolf Ahlswede, Vladimir M. Blinovsky
2006	—	`ed.`	General Theory of Information Transfer and Combinatorics GTIT-C Rudolf Ahlswede, Lars Bäumer, Ning Cai, Harout K. Aydinian, Vladimir M. Blinovsky, Christian Deppe, Haik Mashurian
2006	J	`jnl`	Maximal sets of numbers not containing J. Comb. Theory A Rudolf Ahlswede, Vladimir M. Blinovsky
2006	—	`conf`	Two Problems from Coding Theory. GTIT-C Vladimir M. Blinovsky
2005	J	`jnl`	Code bounds for multiple packings over a nonbinary finite alphabet. Probl. Inf. Transm. Vladimir M. Blinovsky
2005	J	`jnl`	Correlation Inequalities in Function Spaces. Electron. Notes Discret. Math. Rudolf Ahlswede, Vladimir M. Blinovsky
2005	J	`jnl`	Multiple Packing in Sum-type Metric Spaces. Electron. Notes Discret. Math. Rudolf Ahlswede, Vladimir M. Blinovsky
2005	J	`jnl`	Random Sphere Packing. Probl. Inf. Transm. Vladimir M. Blinovsky
2003	J	`jnl`	Large Deviations in Quantum Information Theory. Probl. Inf. Transm. Rudolf Ahlswede, Vladimir M. Blinovsky
2002	J	`jnl`	New Approach to Estimation of the Decoding Error Probability. Probl. Inf. Transm. Vladimir M. Blinovsky
2002	J	`jnl`	Random Young Diagram, Variational Method, and Related Problems. Probl. Inf. Transm. Vladimir M. Blinovsky
2002	J	`jnl`	Size of the Largest Antichain in a Partition Poset. Probl. Inf. Transm. Vladimir M. Blinovsky, Lawrence H. Harper
2001	J	`jnl`	Error Probability Exponent of List Decoding at Low Rates. Probl. Inf. Transm. Vladimir M. Blinovsky
2001	J	`jnl`	Large Deviation Principle for Poisson Random Variables and Young Diagrams. Probl. Inf. Transm. Vladimir M. Blinovsky
2001	J	`jnl`	Uniform Estimate for a Spectrum of a Linear Code. Probl. Inf. Transm. Vladimir M. Blinovsky
1992	J	`jnl`	List decoding. Discret. Math. Vladimir M. Blinovsky