Generalized orthogonal designs

Georgiou, S; Koukouvinos, C; Seberry, J

dc.contributor.author	Georgiou, S	en
dc.contributor.author	Koukouvinos, C	en
dc.contributor.author	Seberry, J	en
dc.date.accessioned	2014-03-01T01:20:33Z
dc.date.available	2014-03-01T01:20:33Z
dc.date.issued	2004	en
dc.identifier.issn	0381-7032	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/15962
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-23344444548&partnerID=40&md5=bbd9b7658534ff31b6816895f5a354d5	en
dc.relation.uri	http://www.informatik.uni-trier.de/~ley/db/journals/arscom/arscom71.html#GeorgiouKS04	en
dc.subject	Autocorrelation	en
dc.subject	Circulant matrices	en
dc.subject	Construction	en
dc.subject	Generalized orthogonal designs	en
dc.subject	Orthogonal design	en
dc.subject	Sequence	en
dc.subject.classification	Mathematics	en
dc.title	Generalized orthogonal designs	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	2004	en
heal.abstract	Orthogonal designs and their special cases such as weighing matrices and Hadamard matrices have many applications in combinatorics, statistics, and coding theory as well as in signal processing. In this paper we generalize the definition of orthogonal designs, we give many constructions for these designs and we prove some multiplication theorems that, most of them, can also be applied in the special case of orthogonal designs. Some necessary conditions for the existence of generalized orthogonal designs are also given.	en
heal.publisher	CHARLES BABBAGE RES CTR	en
heal.journalName	Ars Combinatoria	en
dc.identifier.isi	ISI:000220545400002	en
dc.identifier.volume	71	en
dc.identifier.spage	33	en
dc.identifier.epage	47	en