𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constructing covering codes by tabu search

✍ Scribed by Patric R. J. Östergård

Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
135 KB
Volume
5
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis

The problem of finding good covering codes in Hamming spaces is considered. Many different local search methods have been used to find packing codes (the dual problem), whereas practically all published results on searches for covering codes are based on simulated annealing. In this article tabu search is evaluated and compared against the simulated annealing method. A novel neighborhood function is also presented. The combination of a new optimization method and a new neighborhood function turns out to speed up the search for covering codes remarkably compared to the traditional simulated annealing approach. Using the new approach, the best known upper bound for the football pool problem for 9 matches is improved to 1341.

📜 SIMILAR VOLUMES

The optimality of Feng–Rao designed mini
The optimality of Feng–Rao designed minimum distance for Hermitian codes constructed by weight order based on pole order
✍ Daisuke Umehara; Shinji Miura; Tomohiko Uyematsu; Eiji Okamoto 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 313 KB 👁 2 views

The algebraic geometric code is known as a linear code that guarantees a relatively large minimum distance under the condition that the number of check symbols is kept constant, when the code length is long. Recently, Saints and Heegard presented a unified theory for decoding of the algebraic geomet