Energy bounds for codes and designs in Hamming spaces
Résumé
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.
Domaines
Théorie de l'information [cs.IT]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...