Construction of new self-dual codes over GF(5) using skew-Hadamard matrices

Koukouvinos, C; Simos, DE

dc.contributor.author	Koukouvinos, C	en
dc.contributor.author	Simos, DE	en
dc.date.accessioned	2014-03-01T01:30:01Z
dc.date.available	2014-03-01T01:30:01Z
dc.date.issued	2009	en
dc.identifier.issn	1930-5346	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/19454
dc.subject	Construction	en
dc.subject	Self-dual codes	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.classification	Mathematics, Applied	en
dc.subject.other	DOUBLE CIRCULANT	en
dc.subject.other	F5	en
dc.subject.other	CLASSIFICATION	en
dc.subject.other	ORDER-24	en
dc.subject.other	WEIGHT	en
dc.subject.other	F-7	en
dc.title	Construction of new self-dual codes over GF(5) using skew-Hadamard matrices	en
heal.type	journalArticle	en
heal.identifier.primary	10.3934/amc.2009.3.251	en
heal.identifier.secondary	http://dx.doi.org/10.3934/amc.2009.3.251	en
heal.language	English	en
heal.publicationDate	2009	en
heal.abstract	In this paper, we give optimal self-dual codes over GF(5) for lengths 24, 40, 48 and 56. In particular, new inequivalent [48, 24] and [56, 28] self-dual codes over GF(5) whose minimum weights are 14 and 16, are constructed using skew-Hadamard matrices of order 24 and 28, thus improving the only known quadratic double circulant self-dual codes of length 48 and 56. Moreover, [80, 40] and [88, 44] self-dual codes whose minimum weights are 17 and 19 over GF(5), are constructed for the first time. These codes are derived from skew-Hadamard matrices of order 40 and 44, respectively. Finally, a new [56, 28, 17] self-dual code is constructed over GF(7) having the highest minimum weight among [56, 28] self-dual codes. This new optimal code is constructed from a skew-Hadamard-matrix of order 28, for the first time. ©2009 AIMS-SDU.	en
heal.publisher	AMER INST MATHEMATICAL SCIENCES	en
heal.journalName	Advances in Mathematics of Communications	en
dc.identifier.doi	10.3934/amc.2009.3.251	en
dc.identifier.isi	ISI:000269220600004	en
dc.identifier.volume	3	en
dc.identifier.issue	3	en
dc.identifier.spage	251	en
dc.identifier.epage	263	en