Dimitris E. Simos

Dimitris E. Simos

Auto-generated profile, based on publicly available information

Dimitris E. Simos

SBA Research, Vienna, Austria

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
1 July 2008 in Journal of Statistical Planning and Inference
Verified
Journal Article
Closed access
CKChristos Koukouvinos
Christos Koukouvinos
KMKALLIOPI MYLONA
KALLIOPI MYLONA
DSDimitris E. Simos
Dimitris E. Simos

1 March 2007 in Computational Statistics & Data Analysis
Verified
Journal Article
Closed access
CKChristos Koukouvinos
Christos Koukouvinos
KMKALLIOPI MYLONA
KALLIOPI MYLONA
DSDimitris E. Simos
Dimitris E. Simos

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.

1 February 2009 in Journal of Statistical Planning and Inference
Verified
Journal Article
Closed access
CKChristos Koukouvinos
Christos Koukouvinos
KMKALLIOPI MYLONA
KALLIOPI MYLONA
DSDimitris E. Simos
Dimitris E. Simos

1 October 2009 in Journal of Discrete Mathematical Sciences and Cryptography
Verified
Journal Article
Closed access
CKChristos Koukouvinos
Christos Koukouvinos
BLB. Lappas
B. Lappas
DSD. E. Simos
D. E. Simos
In this paper, we propose an encryption scheme based on orthogonal arrays. A cryptanalysis of the proposed scheme against some popular attacks, brute force, plaintext attacks and ciphertext attacks is explored and our study shows that these attacks does not compromise the security of the system. Furthermore, we make use of the Kronecker product to strengthen our encryption scheme while maintaining the private key size in reasonable lengths.

15 September 2011 in Information Processing Letters
Verified
Journal Article
Closed access
CKChristos Koukouvinos
Christos Koukouvinos
VPVeronika Pillwein
Veronika Pillwein
DSDimitris E. Simos
Dimitris E. Simos
ZZZafeirakis Zafeirakopoulos
Zafeirakis Zafeirakopoulos