Designing linear binary block codes: Constructive heuristics and iterated local search
Error correcting codes such as linear binary block codes (LBBCs) 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 LBBCs can be stated as an $NP$-hard combinatoria...
| Autor: | |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 2005 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/85739 |
| Acceso en línea: | https://hdl.handle.net/2117/85739 |
| Access Level: | acceso abierto |
| Palabra clave: | Error correcting code design Linear binary block codes (Multi-start) constructive heuristics Iterated local search Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Sumario: | Error correcting codes such as linear binary block codes (LBBCs) 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 LBBCs can be stated as an $NP$-hard combinatorial optimization problem. Due to its hardness several metaheuristic approaches have been proposed in the literature for its solution. In this paper we present different algorithms based on solution construction and on iterated local search. The experimental evaluation shows that a simple multi-start constructive heuristic is often between 2 and 3 orders of magnitude faster than the 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 multi-start constructive heuristic and state-of-the-art metaheuristics. |
|---|