Lower Bounds for q-ary Codes with Large Covering Radius.

Wolfgang Haas Immanuel Halupczok Jan-Christoph Schlage-Puchta

Published in: Electron. J. Comb. (2009)

Keyphrases

lower bound
upper bound
branch and bound
branch and bound algorithm
np hard
lower and upper bounds
objective function
error correction
quadratic assignment problem
worst case
online algorithms
optimal solution
lower bounding
optimal cost
circular arcs
linear programming relaxation
error control