Ilias S. Kotsireas

Ilias S. Kotsireas

Auto-generated profile, based on publicly available information

Ilias S. Kotsireas

Wilfrid Laurier University

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 July 2013 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
DƉDragomir Ž. Ɖoković
Dragomir Ž. Ɖoković
IKIlias S. Kotsireas
Ilias S. Kotsireas

12 June 2013 in Journal of Combinatorial Designs
Verified
Journal Article
Closed access
PDF file
DĐDragomir Ž. Đoković
Dragomir Ž. Đoković
OGOleg Golubitsky
Oleg Golubitsky
IKIlias S. Kotsireas
Ilias S. Kotsireas

16 September 2014 in Numerical Algorithms
Verified
Journal Article
Closed access
PDF file
DÐDragomir Ž. Ðoković
Dragomir Ž. Ðoković
IKIlias S. Kotsireas
Ilias S. Kotsireas

13 April 2012 in Journal of Combinatorial Designs
Verified
Journal Article
Closed access
PDF file
DĐDragomir Ž. Đoković
Dragomir Ž. Đoković
IKIlias S. Kotsireas
Ilias S. Kotsireas

1 December 2018 in Mathematics in Computer Science
Verified
Journal Article
Closed access
PDF file
DƉDragomir Ž. Ɖoković
Dragomir Ž. Ɖoković
IKIlias S. Kotsireas
Ilias S. Kotsireas

1 January 2009 in Advances in Mathematics of Communications
Verified
Journal Article
Open access
PDF file
IKIlias S. Kotsireas
Ilias S. Kotsireas
CKChristos Koukouvinos
Christos Koukouvinos
DSDimitris E. Simos
Dimitris E. Simos
In this paper, we are interested in the construction of maximum distance separable (MDS) self-dual codes over large prime fields that arise from the solutions of systems of diophantine equations. Using this method we con- struct many self-dualMDS (or near-MDS) codes of lengths up to 16 over various prime fields $GF(p)$, where $p$ = 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 53, 61, 73, 89, 97, 101, 109, 113, 137, 149, 157, 173, 181, 193 and 197. In addition, a number of optimal codes are presented for many lengths up to 40 over small prime fields $GF(p)$. Furthermore, our results on the minimum weight of self-dual codes over prime fields give a better bound than the Pless-Pierce bound obtained from a modified Gilbert-Varshamov bound.