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

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

The paper completes the proof of an upper bound for multiple packings in a q-ary Hamming space and proves the existence of a black-box-like representation of space in which multiple packs can be placed.Expand