A variable neighbourhood search heuristic for the design of codes

Derek Smith, Francis Hunt, R. Montemanni, M. Salani

Allbwn ymchwil: Pennod mewn Llyfr/Adroddiad/Trafodion CynhadleddCyfraniad i gynhadleddadolygiad gan gymheiriaid

55 Wedi eu Llwytho i Lawr (Pure)

Crynodeb

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.
Iaith wreiddiolSaesneg
TeitlN/A
Tudalennau127-132
StatwsCyhoeddwyd - 9 Mai 2012
Digwyddiad The 8th International Conference on Computing and Information Technology (IC2IT 2012) - Pattaya City, Thailand.
Hyd: 9 May 201210 May 2012

Cynhadledd

Cynhadledd The 8th International Conference on Computing and Information Technology (IC2IT 2012)
Cyfnod9/05/1210/05/12

Ôl bys

Gweld gwybodaeth am bynciau ymchwil 'A variable neighbourhood search heuristic for the design of codes'. Gyda’i gilydd, maen nhw’n ffurfio ôl bys unigryw.

Dyfynnu hyn