New self-dual codes over GF(5)

Georgiou, S; Koukouvinos, C

dc.contributor.author	Georgiou, S	en
dc.contributor.author	Koukouvinos, C	en
dc.date.accessioned	2014-03-01T01:14:52Z
dc.date.available	2014-03-01T01:14:52Z
dc.date.issued	1999	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/13257
dc.subject	self-dual codes	en
dc.subject	construction	en
dc.subject	orthogonal designs	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.title	New self-dual codes over GF(5)	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/3-540-46665-7_6	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-46665-7_6	en
heal.language	English	en
heal.publicationDate	1999	en
heal.abstract	Self-dual codes and orthogonal designs have been studied for a long time as separate research areas. In the present paper we show a strong relationship between them. The structure of orthogonal designs is such as to allow us a much faster and more systematic search for self-dual codes over GF(5). Using our method we constructed the following linear self-dual codes over GF(B):(i) [4,2,2], (ii) [8,4,4], (iii) [12,6,6], (iv) [16,8,6], (v) [20,10,8], (vi) [24,12,9], (vii) [28,14,10]. The codes (i), (ii), (iii), (v) are extremal. A [28,14,10] code is constructed here for the first time.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	CRYPTOGRAPHY AND CODING	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.doi	10.1007/3-540-46665-7_6	en
dc.identifier.isi	ISI:000165599900006	en
dc.identifier.volume	1746	en
dc.identifier.spage	63	en
dc.identifier.epage	69	en