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… Expand

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

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

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

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 results… Expand

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

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

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.