Title :
New constant weight codes from linear permutation groups
Author :
Nurmela, Kari J. ; Kaikkonen, Markku K. ; Östergard, Patric R J
Author_Institution :
Dept. of Comput. Sci., Helsinki Univ. of Technol., Espoo, Finland
fDate :
29 Jun-4 Jul 1997
Abstract :
New constant weight codes are found by considering certain linear permutation groups. A code is obtained as a collection of orbits of words under such a group. This leads to a difficult optimization problem, where a stochastic search heuristic, tabu search, is used to find good solutions in a feasible amount of time
Keywords :
binary sequences; codes; group theory; optimisation; search problems; NP-complete problem; binary words; constant weight codes; group; linear permutation groups; minimum distance; optimization problem; orbits; stochastic search heuristic; tabu search; Computer science; Cost function; Mathematics; Optimization methods; Orbits; Partitioning algorithms; Stochastic processes;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613390
