• Publications
  • Influence
Classical Capacity of Classical-Quantum Arbitrarily Varying Channels
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 alsoExpand
List decoding
  • V. Blinovsky
  • Computer Science, Mathematics
  • Discret. Math.
  • 1 October 1992
Asymptotic Enumeration of Sparse Uniform Linear Hypergraphs with Given Degrees
TLDR
The approach is to work with the incidence matrix of a hypergraph, interpreted as the biadjacency Matrix of a bipartite graph, enabling us to apply known enumeration results for bipartITE graphs and lead to a new asymptotic enumeration formula for simple uniform hypergraphs with specified degrees. Expand
General Theory of Information Transfer and Combinatorics
TLDR
Reports on Models of Write-Efficient Memories with Localized Errors and Defects and Problems in Network Coding. Expand
Asymptotic enumeration of sparse uniform hypergraphs with given degrees
TLDR
An asymptotic enumeration formula for simple r -uniform hypergraphs with degree sequence k is presented, which holds whenever the maximum degree k max satisfies k max 3 = o ( M ) . Expand
A remark on the problem of nonnegative k-subset sums
TLDR
It is conjecture that the problems raised by Ahlswede and Khachatrian and the problem of determining a minimal number cn(k) such that any k-uniform hypergraph on n vertices having cn (k) + 1 edges has a perfect fractional matching have the same solution. Expand
Asymptotic Combinatorial Coding Theory
From the Publisher: Asymptotic Combinatorial Coding Theory is devoted to the investigation of the combinatorial properties of transmission systems using discrete signals. The book presents resultsExpand
Code bounds for multiple packings over a nonbinary finite alphabet
  • V. Blinovsky
  • Mathematics, Computer Science
  • Probl. Inf. Transm.
  • 2005
TLDR
For the zero rate, tightness of the expurgation bound is proved and asymptotic bounds for multiple packings in the space of q-ary sequences of length n are constructed. Expand
Lectures on advances in combinatorics
TLDR
This paper presents a meta-modelling procedure that automates the very labor-intensive and therefore time-heavy and therefore expensive and expensive process of manually cataloging and packing items for use in number theory. Expand
Multiple Packing of the Euclidean Sphere
  • V. Blinovsky
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 29 June 1997
We obtain the asymptotical bounds on the radius of the Euclidean sphere, such that any sphere with this radius contains not more, than L points from the subset of the unit Euclidean sphere.
...
1
2
3
4
5
...