Mehmet Özen

According to our database1, Mehmet Özen authored at least 15 papers between 2004 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Some skew constacyclic codes over $$\mathbb {F}_{q}+u\mathbb {F}_{q}$$.
Comput. Appl. Math., 2021

2019
Self-Dual Skew Cyclic Codes over F<sub>q</sub>+uF<sub>q</sub>.
CoRR, 2019

2016
Feistel Like Construction of Involutory Binary Matrices With High Branch Number.
IACR Cryptol. ePrint Arch., 2016

Cyclic and some constacyclic codes over the ring.
Finite Fields Their Appl., 2016

Cryptanalysis of QTL Block Cipher.
Proceedings of the Lightweight Cryptography for Security and Privacy, 2016

2015
A Guess-and-Determine Attack on Reduced-Round Khudra and Weak Keys of Full Cipher.
IACR Cryptol. ePrint Arch., 2015

2014
The MacWilliams identity for m-spotty Rosenbloom-Tsfasman weight enumerator.
J. Frankl. Inst., 2014

2012
Quantum codes from codes over Gaussian integers with respect to the Mannheim metric.
Quantum Inf. Comput., 2012

2011
Cyclic codes over some finite quaternion integer rings.
J. Frankl. Inst., 2011

The MacWilliams identity for m-spotty weight enumerators of linear codes over finite fields.
Comput. Math. Appl., 2011

2010
Nonbinary quantum stabilizer codes from codes over Gaussian integers with respect to the Mannheim metric
CoRR, 2010

2009
Cyclic Codes over Some Finite Rings
CoRR, 2009

2007
Codes over Galois rings with respect to the Rosenbloom-Tsfasman metric.
J. Frankl. Inst., 2007

2006
Linear Codes over F<sub>q</sub>[u]/(u<sup>s</sup>) with Respect to the Rosenbloom-Tsfasman Metric.
Des. Codes Cryptogr., 2006

2004
The complete weight enumerator for codes over <sub>M</sub> n times s(R).
Appl. Math. Lett., 2004


  Loading...