Vladimir M. Blinovsky

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:93/831 · DBLP profile ↗

← Back

9ranked-venue papers

6as first author

0since 2021 · last 2011

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 5 · 4 first-authorTheory of computation · 2Security and privacy · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science

1 paper

Quantum computing and quantum information · 60% Information theory · 40%

Topics — the 5 heaviest of 5, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Information theory › channel capacity arbitrarily varying channel	0.1	1	2007	Classical Capacity of Classical-Quantum Arbitrarily Varying Channels · IEEE Trans. Inf. Theory 2007
Information theory channel capacity	0.1	1	2007	Classical Capacity of Classical-Quantum Arbitrarily Varying Channels · IEEE Trans. Inf. Theory 2007
Quantum computing and quantum information › quantum channel capacity classical capacity	0.1	1	2007	Classical Capacity of Classical-Quantum Arbitrarily Varying Channels · IEEE Trans. Inf. Theory 2007
Quantum computing and quantum information › quantum channel classical-quantum channel	0.1	1	2007	Classical Capacity of Classical-Quantum Arbitrarily Varying Channels · IEEE Trans. Inf. Theory 2007
Quantum computing and quantum information quantum information theory	0.1	1	2007	Classical Capacity of Classical-Quantum Arbitrarily Varying Channels · IEEE Trans. Inf. Theory 2007

Methods — techniques the papers use, named apart from their topics

random coding · 0.1dichotomy theorem · 0.1

Year	Publication	Venue	Position
2011	About the reliability function of symmetric channel under list decoding abstract We complete the derivation of the formula for the reliability function of q-ary symmetric channel under list decoding for zero rate. Vladimir M. Blinovsky	ISIT	1
2011	New Asymptotic Bounds on the Size of Multiple Packings of the Euclidean Sphere Vladimir M. Blinovsky, Simon Litsyn	Discret. Comput. Geom.	1
2010	Weight distribution moments of random linear/coset codes Vladimir M. Blinovsky, Uri Erez, Simon Litsyn	Des. Codes Cryptogr.	1
2009	Generalization of Plotkin bound to the case of multiple packing abstract We derive an upper bound for the cardinality of multiple packing in the case of large decoding radius. Vladimir M. Blinovsky	ISIT	1
2009	New asymptotic bounds on the size of list codes on Euclidean sphere abstract Using lower bounds on components of the distance spectrum of a code on the Euclidean sphere obtained by linear programming, we derive new, better than known, upper bounds on the size of multiple packings. Vladimir M. Blinovsky, Simon Litsyn	ISIT	1
2008	About convexity of one function from coding theory abstract We complete the proof of upper bound for the multiple packing of q-ary Hamming space. Vladimir M. Blinovsky	ISIT	1
2008	Multiple packing in sum-type metric spaces Rudolf Ahlswede, Vladimir M. Blinovsky	Discret. Appl. Math.	2
2007	Classical Capacity of Classical-Quantum Arbitrarily Varying Channels abstract We prove that the average error classical capacity C(W) of a classicalquantum arbitrarily varying channel (cq-AVC) W equals 0 or else the random code capacity C (Ahlswede's dichotomy). We also establish a necessary and sufficient condition for C(W)>0 Rudolf Ahlswede, Vladimir M. Blinovsky	IEEE Trans. Inf. Theory	2
2006	Capacity of Quantum Arbitrarily Varying Channels abstract We prove that the average error capacity Cqof a quantum arbitrarily varying channel (QAVC) equals 0 or else the random code capacity lowbarC (Ahlswede's dichotomy). We also establish a necessary and sufficient condition for Cq> 0 Rudolf Ahlswede, Vladimir M. Blinovsky	ISIT	2