Periodic complementary binary sequences and Combinatorial Optimization algorithms

Kotsireas, IS; Koukouvinos, C; Pardalos, PM; Shylo, OV

dc.contributor.author	Kotsireas, IS	en
dc.contributor.author	Koukouvinos, C	en
dc.contributor.author	Pardalos, PM	en
dc.contributor.author	Shylo, OV	en
dc.date.accessioned	2014-03-01T01:34:17Z
dc.date.available	2014-03-01T01:34:17Z
dc.date.issued	2010	en
dc.identifier.issn	1382-6905	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/20678
dc.subject	Algorithms	en
dc.subject	Combinatorial Optimization	en
dc.subject	Periodic Autocorrelation Function	en
dc.subject	Periodic complementary binary sequences	en
dc.subject.classification	Computer Science, Interdisciplinary Applications	en
dc.subject.classification	Mathematics, Applied	en
dc.subject.other	Combinatorial optimization algorithm	en
dc.subject.other	Finite sequence	en
dc.subject.other	Open problems	en
dc.subject.other	Periodic Autocorrelation Function	en
dc.subject.other	Periodic autocorrelation functions	en
dc.subject.other	Periodic complementary binary sequences	en
dc.subject.other	Algorithms	en
dc.subject.other	Autocorrelation	en
dc.subject.other	Combinatorial optimization	en
dc.subject.other	Regression analysis	en
dc.subject.other	Binary sequences	en
dc.title	Periodic complementary binary sequences and Combinatorial Optimization algorithms	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/s10878-008-9194-5	en
heal.identifier.secondary	http://dx.doi.org/10.1007/s10878-008-9194-5	en
heal.language	English	en
heal.publicationDate	2010	en
heal.abstract	We establish a new formalism for problems pertaining to the periodic autocorrelation function of finite sequences, which is suitable for Combinatorial Optimization methods. This allows one to bring to bear powerful Combinatorial Optimization methods in a wide array of problems that can be formulated via the periodic autocorrelation function. Using this new formalism we solve all remaining open problems regarding periodic complementary binary sequences, in the context of the Bömer and Antweiler diagram and thus complete the program that they started in 1990. © 2008 Springer Science+Business Media, LLC.	en
heal.publisher	SPRINGER	en
heal.journalName	Journal of Combinatorial Optimization	en
dc.identifier.doi	10.1007/s10878-008-9194-5	en
dc.identifier.isi	ISI:000280232600004	en
dc.identifier.volume	20	en
dc.identifier.issue	1	en
dc.identifier.spage	63	en
dc.identifier.epage	75	en