Codes play a central role in information theory. A code is a set of words of a given length from a given alphabet of symbols. The words of a code have to fulfil some application-dependent constraints in order to guarantee some form of separation between the words. Typical applications ofcodes are for error-correction following transmission or storage of data, or for modulation of signals in communications. The target is to have codes with as many codewords as possible, in order to maximise efficiency and provide freedom to engineers designing the applications. In this paper a variable neighbourhood search framework, used to construct codes in a heuristic fashion, is described. Results on different types of codes of practical interest are presented, showing the potential of the new tool.
|Title of host publication
|Published - 9 May 2012
| The 8th International Conference on Computing and Information Technology (IC2IT 2012) - Pattaya City, Thailand.
Duration: 9 May 2012 → 10 May 2012
|The 8th International Conference on Computing and Information Technology (IC2IT 2012)
|9/05/12 → 10/05/12
- code design
- heuristic algorithms
- variable neighbourhood search