An algorithm to find values of minors of skew Hadamard and conference matrices

Kravvaritis, C; Lappas, E; Mitrouli, M

dc.contributor.author	Kravvaritis, C	en
dc.contributor.author	Lappas, E	en
dc.contributor.author	Mitrouli, M	en
dc.date.accessioned	2014-03-01T02:43:06Z
dc.date.available	2014-03-01T02:43:06Z
dc.date.issued	2005	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31233
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-24144489108&partnerID=40&md5=2aa8a09cc4a68deae0229d6f37812c13	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	Algorithms	en
dc.subject.other	Numerical analysis	en
dc.subject.other	Conference matrices	en
dc.subject.other	Skew Hadamard	en
dc.subject.other	Skew matrices	en
dc.subject.other	Matrix algebra	en
dc.title	An algorithm to find values of minors of skew Hadamard and conference matrices	en
heal.type	conferenceItem	en
heal.language	English	en
heal.publicationDate	2005	en
heal.abstract	We give an algorithm to obtain formulae and values for minors of skew Hadamard and conference matrices. One step in our algorithm allows the (n - j) × (n - j) minors of skew Hadamard and conference matrices to be given in terms of the minors of a 2j-1 × 2j-1 matrix. In particular we illustrate our algorithm by finding explicitly all the (n - 3) × (n - 3) minors of such matrices. © Springer-Verlag Berlin Heidelberg 2005.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	Lecture Notes in Computer Science	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.isi	ISI:000229020800045	en
dc.identifier.volume	3401	en
dc.identifier.spage	375	en
dc.identifier.epage	382	en