DocumentCode :
1552908
Title :
New constant weight codes from linear permutation groups
Author :
Nurmela, Kari J. ; Kaikkonen, Markku K. ; Östergård, Patric R J
Author_Institution :
Dept. of Comput. Sci., Helsinki Univ. of Technol., Espoo, Finland
Volume :
43
Issue :
5
fYear :
1997
fDate :
9/1/1997 12:00:00 AM
Firstpage :
1623
Lastpage :
1630
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. Nearly 40 new codes of length at most 28 are presented
Keywords :
combinatorial mathematics; linear codes; optimisation; search problems; code length; constant weight codes; linear permutation groups; optimization problem; stochastic search heuristic; tabu search; Binary codes; Error correction; Error correction codes; Minerals; Notice of Violation; Orbits; Petroleum; Stochastic processes;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.623163
Filename :
623163
Link To Document :
بازگشت