A Mixed Heuristic for Generating Cocyclic Hadamard Matrices

被引：0

作者：

Alvarez, V. ^{[1
]}

Armario, J. A. ^{[1
]}

Falcon, R. M. ^{[2
]}

Frau, M. D. ^{[1
]}

Gudiel, F. ^{[1
]}

Guemes, M. B. ^{[3
]}

Osuna, A. ^{[1
]}

机构：

[1] Univ Seville, ETSI Informat, Dept Matemat Aplicada 1, Avda Reina Mercedes S-N, E-41012 Seville, Spain

[2] Univ Seville, ETSA, Dept Matemat Aplicada 1, Avda Reina Mercedes S-N, E-41012 Seville, Spain

[3] Univ Seville, Fac Matemat, Dept Algebra, C Tarfia S-N, E-41012 Seville, Spain

来源：

MATHEMATICS IN COMPUTER SCIENCE | 2018年 / 12卷 / 04期

关键词：

Hadamard matrices; Cocyclic matrices; Heuristic; Constraint satisfaction problem; Primary; 05B20; Secondary; 05B30;

D O I：

10.1007/s11786-018-0377-x

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A way of generating cocyclic Hadamard matrices is described, which combines a new heuristic, coming from a novel notion of fitness, and a peculiar local search, defined as a constraint satisfaction problem. Calculations support the idea that finding a cocyclic Hadamard matrix of order might be within reach, for the first time, progressing further upon the ideas explained in this work.

引用

页码：407 / 417

页数：11