An efficient string sorting algorithm for weighing matrices of small weight

Kotsireas, I; Koukouvinos, C; Pardalos, P

dc.contributor.author	Kotsireas, I	en
dc.contributor.author	Koukouvinos, C	en
dc.contributor.author	Pardalos, P	en
dc.date.accessioned	2014-03-01T01:59:07Z
dc.date.available	2014-03-01T01:59:07Z
dc.date.issued	2010	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/28840
dc.subject	Algorithmic Information Theory	en
dc.subject	Autocorrelation Function	en
dc.subject	Combinatorial Optimization	en
dc.subject	kolmogorov complexity	en
dc.subject	Linear Time Algorithm	en
dc.subject	Sorting Algorithm	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.publicationDate	2010	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	en
heal.journalName	Optimization Letters	en
dc.identifier.doi	10.1007/s11590-009-0144-7	en