Iterated local search and constructive heuristics for error correcting code design
by Christian Blum
International Journal of Innovative Computing and Applications (IJICA), Vol. 1, No. 1, 2007

Abstract: Error Correcting Codes (ECCs) play an important role, for example, in the transmission of messages over telecommunication networks or in reading information from digital data media such as DVDs or CDs. The design of ECCs is computationally a hard problem. Due to its hardness, several metaheuristic approaches for its solution have been proposed in the literature. In this paper, we present different algorithms based on solution construction and iterated local search. The experimental evaluation shows that a simple multistart constructive heuristic is often between two and three orders of magnitude faster than current state-of-the-art metaheuristics when applied to rather small problem instances. When bigger problem instances are concerned, the proposed iterated local search algorithm has advantages over both the multistart constructive heuristic and state-of-the-art metaheuristics.

Online publication date: Wed, 25-Apr-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Innovative Computing and Applications (IJICA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com