The Lovasz bound and some generalizations

摘要: The zero error capacity of a discrete memoryless channel is defined as the largest rate at which information can be transmitted over with probability. One five inputs and outputs whose remained unsolved until very recently considered. An extremely powerful general technique phased in terms graph theory, for studying combinatorial packing problems presented. In particular, Delsarte's linear programming bound cliques association schemes appears special case Lovasz bound.