Bounds for short covering codes and reactive tabu search

Given a prime power q, c"q(n,R) denotes the minimum cardinality of a subset H in F"q^n such that every word in this space differs in at most R coordinates from a multiple of a vector in H. In this work, two new classes of short coverings are established. As an application, a new optimal record-breaking result on the classical covering code is obtained by using short covering. We also reformulate the numbers c"q(n,R) in terms of dominating set on graphs. Departing from this reformulation, the reactive tabu search (a variation of tabu search heuristics) is developed to obtain new upper bounds on c"q(n,R). The algorithm is described and conclusions on the results are drawn; they identify the advantages of using the reactive mechanism for this problem. Tables of lower and upper bounds on c"q(n,R), q=3,4, n@?7, and R@?3, are also presented.

[1]  Mahesh C. Bhandari,et al.  A note on bounds for q-ary covering codes , 1996, IEEE Trans. Inf. Theory.

[2]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[3]  Gérard D. Cohen,et al.  Covering Codes , 2005, North-Holland mathematical library.

[4]  R. Brualdi,et al.  Handbook Of Coding Theory , 2011 .

[5]  Aileen Mary Mcloughlin,et al.  On the covering radius. , 1977 .

[6]  Niaz A. Wassan,et al.  A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls , 2002 .

[7]  Patric R. J. Östergård,et al.  Upper bounds for q-ary covering codes , 1991, IEEE Trans. Inf. Theory.

[8]  Walter Alexandre Carnielli,et al.  On covering and coloring problems for rook domains , 1985, Discret. Math..

[9]  John Todd,et al.  Covering theorems for groups , 1948 .

[10]  Patric R. J. Östergård,et al.  Constructing covering codes by tabu search , 1997 .

[11]  Jörn Quistorff,et al.  Lower bounds on covering codes via partition matrices , 2009, J. Comb. Theory, Ser. A.

[12]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[13]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[14]  Jeff Linderoth,et al.  The Tera-Gridiron: A Natural Turf for High-Throughput Computing , 2007 .

[15]  Emerson L. Monte Carmelo,et al.  Short coverings in tridimensional spaces arising from sum-free sets , 2008, Eur. J. Comb..

[16]  Gérard D. Cohen,et al.  Linear Codes with Covering Radius and Codimension , 2001 .

[17]  Maxim Sviridenko,et al.  Approximation algorithms for shop scheduling problems with minsum objective , 2002 .

[18]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[20]  Gerzson Kéri,et al.  On the covering radius of small codes , 2003 .