Energy bounds for codes and designs in Hamming spaces
Abstract
We apply linear programming techniques for obtaining lower and upper bounds on the energy of error-correcting codes and for designs in Hamming spaces H(n, q). Our bounds are universal in the sense they hold for a large class of potential functions and allow unified treatment.
Domains
Information Theory [cs.IT]
Origin : Files produced by the author(s)
Loading...