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...

Full description

Saved in:

Bibliographic Details
Published in:	Linear algebra and its applications Vol. 721; pp. 149 - 171
Main Authors:	Perera, Sirani M., Kotsireas, Ilias S.
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 15.09.2025
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!