An efficient string sorting algorithm for weighing matrices of small weight

DOI10.1007/s11590-009-0144-7zbMath1227.05100OpenAlexW2014643492MaRDI QIDQ845549

Ilias S. Kotsireas, Panos M. Pardalos, Christos Koukouvinos

Publication date: 29 January 2010

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-009-0144-7

zbMATH Keywords

algorithmpatternweighing matricesstring sortingsparse encoding

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Searching and sorting (68P10) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial optimization (90C27) Applications of design theory to circuits and networks (94C30)

Related Items (4)

Competent genetic algorithms for weighing matrices ⋮ A modified power spectral density test applied to weighing matrices with small weight ⋮ New weighing matrices constructed from two circulant submatrices ⋮ Applying computer algebra systems with SAT solvers to the Williamson conjecture

Cites Work

• Periodic complementary binary sequences and combinatorial optimization algorithms
• New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function---a review
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient string sorting algorithm for weighing matrices of small weight