An efficient string sorting algorithm for weighing matrices of small weight

Kotsireas, IS; Koukouvinos, C; Pardalos, PM

dc.contributor.author	Kotsireas, IS	en
dc.contributor.author	Koukouvinos, C	en
dc.contributor.author	Pardalos, PM	en
dc.date.accessioned	2014-03-01T01:29:49Z
dc.date.available	2014-03-01T01:29:49Z
dc.date.issued	2009	en
dc.identifier.issn	1862-4472	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/19360
dc.subject	Algorithm	en
dc.subject	Pattern	en
dc.subject	Sparse encoding	en
dc.subject	String sorting	en
dc.subject	Weighing matrices	en
dc.subject.other	Algorithmic information theory	en
dc.subject.other	Circulants	en
dc.subject.other	Encoding strings	en
dc.subject.other	Kolmogorov complexity	en
dc.subject.other	Linear-time algorithms	en
dc.subject.other	Pattern	en
dc.subject.other	Periodic autocorrelation functions	en
dc.subject.other	Sorting algorithm	en
dc.subject.other	Speed-ups	en
dc.subject.other	String sorting	en
dc.subject.other	Weighing matrices	en
dc.subject.other	Combinatorial optimization	en
dc.subject.other	Computational complexity	en
dc.subject.other	Encoding (symbols)	en
dc.subject.other	Information theory	en
dc.subject.other	Parallel processing systems	en
dc.subject.other	Regression analysis	en
dc.subject.other	Weighing	en
dc.subject.other	Algorithms	en
dc.title	An efficient string sorting algorithm for weighing matrices of small weight	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/s11590-009-0144-7	en
heal.identifier.secondary	http://dx.doi.org/10.1007/s11590-009-0144-7	en
heal.language	English	en
heal.publicationDate	2009	en
heal.abstract	In this paper, we demonstrate that the search for weighing matrices of small weights constructed from two circulants can be viewed as a string sorting problem together with a linear time algorithm to locate common strings in two sorted arrays. We also introduce a sparse encoding of the periodic autocorrelation function vector, based on concepts from Algorithmic Information Theory, also known as Kolmogorov complexity, that allows us to speed up the algorithm considerably. Finally, we use these ideas to find new weighing matrices W(2 center dot n, 9) constructed from two circulants, for many values of n in the range 100 a parts per thousand currency signA n a parts per thousand currency signA 300. These matrices are given here for the first time. We also discuss briefly a connection with Combinatorial Optimization.	en
heal.publisher	SPRINGER HEIDELBERG	en
heal.journalName	Optimization Letters	en
dc.identifier.doi	10.1007/s11590-009-0144-7	en
dc.identifier.isi	ISI:000272181600004	en
dc.identifier.volume	4	en
dc.identifier.issue	1	en
dc.identifier.spage	29	en
dc.identifier.epage	36	en