Distance Distributions and Energy of Designs in Hamming Spaces

Boyvalenkov, Peter; Marinova, Tanya; Stoyanova, Maya; Sukalinska, Mila

Serdica Journal of Computing (2015)

  • Volume: 9, Issue: 2, page 139-150
  • ISSN: 1312-6555

Abstract

top
We obtain new combinatorial upper and lower bounds for the potential energy of designs in q-ary Hamming space. Combined with results on reducing the number of all feasible distance distributions of such designs this gives reasonable good bounds. We compute and compare our lower bounds to recently obtained universal lower bounds. Some examples in the binary case are considered.

How to cite

top

Boyvalenkov, Peter, et al. "Distance Distributions and Energy of Designs in Hamming Spaces." Serdica Journal of Computing 9.2 (2015): 139-150. <http://eudml.org/doc/281354>.

@article{Boyvalenkov2015,
abstract = {We obtain new combinatorial upper and lower bounds for the potential energy of designs in q-ary Hamming space. Combined with results on reducing the number of all feasible distance distributions of such designs this gives reasonable good bounds. We compute and compare our lower bounds to recently obtained universal lower bounds. Some examples in the binary case are considered.},
author = {Boyvalenkov, Peter, Marinova, Tanya, Stoyanova, Maya, Sukalinska, Mila},
journal = {Serdica Journal of Computing},
keywords = {Designs in Hamming Spaces; Distance Distribution; Energy},
language = {eng},
number = {2},
pages = {139-150},
publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},
title = {Distance Distributions and Energy of Designs in Hamming Spaces},
url = {http://eudml.org/doc/281354},
volume = {9},
year = {2015},
}

TY - JOUR
AU - Boyvalenkov, Peter
AU - Marinova, Tanya
AU - Stoyanova, Maya
AU - Sukalinska, Mila
TI - Distance Distributions and Energy of Designs in Hamming Spaces
JO - Serdica Journal of Computing
PY - 2015
PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences
VL - 9
IS - 2
SP - 139
EP - 150
AB - We obtain new combinatorial upper and lower bounds for the potential energy of designs in q-ary Hamming space. Combined with results on reducing the number of all feasible distance distributions of such designs this gives reasonable good bounds. We compute and compare our lower bounds to recently obtained universal lower bounds. Some examples in the binary case are considered.
LA - eng
KW - Designs in Hamming Spaces; Distance Distribution; Energy
UR - http://eudml.org/doc/281354
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.