Projects per year

## Fingerprint Fingerprint is based on mining the text of the person's scientific documents to create an index of weighted terms, which defines the key subjects of each individual researcher.

- 1 Similar Profiles

##
Network
Dive into details by clicking on the dots.

## Projects 2014 2020

## Quantum codes

Geil, O., Ruano, D., Ozbudak, F., Christensen, R. B., Hernando, F., Galindo, C. & Matsumoto, R.

01/08/2017 → 28/03/2019

Project: Research

## Secret Sharing

Geil, O., Ruano, D., Ozbudak, F., Hernando, F., Høholdt, T., Hansen, J. P., Galindo, C. & Beelen, P.

01/09/2014 → 28/02/2019

Project: Research

## Research Output 2017 2019

## On affine variety codes from the Klein quartic

Geil, H. O. & Ozbudak, F., 15 Mar 2019, In : Cryptography and Communications. 11, 2, p. 237-257 21 p.Research output: Contribution to journal › Journal article › Research › peer-review

## Constructing sequences with high nonlinear complexity using the Weierstrass semigroup of a pair of distinct points of a Hermitian curve

Geil, H. O., Ozbudak, F. & Ruano Benito, D., 1 Jan 2018, (Accepted/In press) In : Semigroup Forum. 13 p.Research output: Contribution to journal › Journal article › Research › peer-review

## A correction and improvements of some recent results on walsh transforms of gold type and Kasami-Welch type functions

Coşgun, A. & Özbudak, F., 2017,*Arithmetic of Finite Fields: 6th International Workshop, WAIFI 2016, Revised Selected Papers.*Springer VS, p. 243-257 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 10064 LNCS).

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review

## A super-set of Patterson-Wiedemann functions – Upper bounds and possible nonlinearities

Kavut, S., Maitra, S. & Özbudak, F., 2017,*Arithmetic of Finite Fields: 6th International Workshop, WAIFI 2016, Revised Selected Papers.*Springer VS, p. 227-242 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 10064 LNCS).

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review

## Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints

Geil, H. O. & Ozbudak, F., 2017,*Coding Theory and Applications: 5th International Castle Meeting, ICMCTA 2017, Vihula, Estonia, August 28-31, 2017, Proceedings.*Barbero, Á. I., Skachek, V. & Ytrehus, Ø. (eds.). Springer VS, p. 128-138 11 p. (Lecture Notes in Computer Science, Vol. 10495).

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review