A low-complexity algorithm to search for Legendre pairs

Legendre pairs constitute an important combinatorial object that can be used to construct Hadamard matrices. In this paper, we search for Legendre pairs exploring matrix structures and obtain a low arithmetic and time complexity algorithm instead of conventional combinatorial algorithms. First, we e...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Linear algebra and its applications Ročník 721; s. 149 - 171
Hlavní autori:	Perera, Sirani M., Kotsireas, Ilias S.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 15.09.2025
Predmet:	Complexity and performance of algorithms Fast Fourier transforms Legendre pairs Matrix analysis Matrix equations Sparse and orthogonal factors Structured matrices Matrix analysis 65T50 15B05 65Y20 65Y04 Legendre pairs 42C10 65F40 Sparse and orthogonal factors Fast Fourier transforms Complexity and performance of algorithms Structured matrices 15A23 15B10 65F15 Matrix equations 65F45 65F35
ISSN:	0024-3795
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!