Ferruh Özbudak

Orcid: 0000-0002-1694-9283

According to our database1, Ferruh Özbudak authored at least 156 papers between 1999 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Griesmer Bound and Constructions of Linear Codes in b-Symbol Metric.
IEEE Trans. Inf. Theory, November, 2024

Complete characterization of a class of permutation trinomials in characteristic five.
Cryptogr. Commun., July, 2024

Construction of self dual codes from graphs.
Appl. Algebra Eng. Commun. Comput., July, 2024

The c-differential uniformity of the perturbed inverse function via a trace function $ {{\,\textrm{Tr}\,}}\big (\frac{x^2}{x+1}\big )$.
Period. Math. Hung., June, 2024

On subfield subcodes obtained from restricted evaluation codes.
Des. Codes Cryptogr., March, 2024

Almost perfect autocorrelation sequences with small number of pauses for applications in magnetic resonance.
Cryptogr. Commun., January, 2024

Asymptotically optimal [2k+1,k,k] -almost affinely disjoint subspaces.
Discret. Math., 2024

Using multi-orbit cyclic subspace codes for constructing optical orthogonal codes.
CoRR, 2024

Characterization of Nearly Self-Orthogonal Quasi-Twisted Codes and Related Quantum Codes.
CoRR, 2024

Quasi-twisted codes as contractions of quasi-cyclic codes.
Adv. Math. Commun., 2024

2023
A New Method to Compute Sequence Correlations Over Finite Fields.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., December, 2023

Theory of additive complementary dual codes, constructions and computations.
Finite Fields Their Appl., December, 2023

Further constructions and characterizations of generalized almost perfect nonlinear functions.
Cryptogr. Commun., December, 2023

Covering Radius of Generalized Zetterberg Type Codes Over Finite Fields of Odd Characteristic.
IEEE Trans. Inf. Theory, November, 2023

Quasi-Cyclic Perfect Codes in Doob Graphs and Special Partitions of Galois Rings.
IEEE Trans. Inf. Theory, September, 2023

Complete characterization of some permutation polynomials of the form x<sup>r</sup>(1+ax<sup>s<sub>1</sub>(q-1)</sup>+bx<sup>s<sub>2</sub>(q-1)</sup>) over $\mathbb {F}_{q^2}$.
Cryptogr. Commun., July, 2023

Classification of some quadrinomials over finite fields of odd characteristic.
Finite Fields Their Appl., March, 2023

Optimal Binary Linear Complementary Pairs of Codes.
Cryptogr. Commun., March, 2023

Butson Hadamard matrices, bent sequences, and spherical codes.
CoRR, 2023

A New Construction of Asymptotically Optimal Almost Affinely Disjoint Spaces.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Covering Radius of Melas Codes.
IEEE Trans. Inf. Theory, 2022

Two or Three Weight Linear Codes From Non-Weakly Regular Bent Functions.
IEEE Trans. Inf. Theory, 2022

Additive cyclic complementary dual codes over F4.
Finite Fields Their Appl., 2022

Complete b-symbol weight distribution of some irreducible cyclic codes.
Des. Codes Cryptogr., 2022

Classification of permutation polynomials of the form x<sup>3g(x<sup>q-1</sup>)</sup> of 픽<sub>q<sup>2</sup></sub> where g(x)=x<sup>3+bx+c</sup> and $b, c \in {\mathbb F}_q^*$.
Des. Codes Cryptogr., 2022

Constructing MRD codes by switching.
CoRR, 2022

Factorization of some polynomials over finite local commutative rings and applications to certain self-dual and LCD codes.
Cryptogr. Commun., 2022

Correction to: New constructions of entanglement-assisted quantum codes.
Cryptogr. Commun., 2022

New constructions of entanglement-assisted quantum codes.
Cryptogr. Commun., 2022

On Two Applications of Polynomials x<sup>k-cx-d</sup> over Finite Fields and More.
Proceedings of the Arithmetic of Finite Fields - 9th International Workshop, 2022

New Correlations of m-sequences over the finite field $\mathbb{F}_{4}$ compatible with a new bijection to $\mathbb{Z}_{4}$.
Proceedings of the 10th International Workshop on Signal Design and Its Applications in Communications, 2022

2021
Geometric Approach to b-Symbol Hamming Weights of Cyclic Codes.
IEEE Trans. Inf. Theory, 2021

LCD codes from tridiagonal Toeplitz matrices.
Finite Fields Their Appl., 2021

New generalized almost perfect nonlinear functions.
Finite Fields Their Appl., 2021

LCD Codes from tridiagonal Toeplitz matrice.
CoRR, 2021

Correlation distribution of a sequence family generalizing some sequences of Trachtenberg.
Adv. Math. Commun., 2021

Hermitian Rank Metric Codes and Duality.
IEEE Access, 2021

On the Parity of Power Permutations.
IEEE Access, 2021

2020
Duals of non-weakly regular bent functions are not weakly regular and generalization to plateaued functions.
Finite Fields Their Appl., 2020

Counting Boolean functions with faster points.
Des. Codes Cryptogr., 2020

Subspace packings: constructions and bounds.
Des. Codes Cryptogr., 2020

2019
Construction of Efficient Codes for High-Order Direct Sum Masking.
Proceedings of the Security and Privacy in the Internet of Things: Challenges and Solutions, 2019

On q-ary plateaued functions over Fq and their explicit characterizations.
Eur. J. Comb., 2019

Linear codes from weakly regular plateaued functions and their secret sharing schemes.
Des. Codes Cryptogr., 2019

Strongly regular graphs arising from non-weakly regular bent functions.
Cryptogr. Commun., 2019

A concatenated construction of linear complementary pair of codes.
Cryptogr. Commun., 2019

On affine variety codes from the Klein quartic.
Cryptogr. Commun., 2019

On Plateaued Functions, Linear Structures and Permutation Polynomials.
Proceedings of the Codes, Cryptology and Information Security, 2019

2018
On Linear Complementary Pairs of Codes.
IEEE Trans. Inf. Theory, 2018

Explicit Full Correlation Distribution of Sequence Families Using Plateaued Functions.
IEEE Trans. Inf. Theory, 2018

A Super-Set of Patterson-Wiedemann Functions: Upper Bounds and Possible Nonlinearities.
SIAM J. Discret. Math., 2018

Some new non-additive maximum rank distance codes.
Finite Fields Their Appl., 2018

Additive cyclic codes over finite commutative chain rings.
Discret. Math., 2018

A new concatenated type construction for LCD codes and isometry codes.
Discret. Math., 2018

On the p-ary (cubic) bent and plateaued (vectorial) functions.
Des. Codes Cryptogr., 2018

Subspace Packings.
CoRR, 2018

Generalized nonbinary sequences with perfect autocorrelation, flexible alphabets and new periods.
Cryptogr. Commun., 2018

Self-duality of generalized twisted Gabidulin codes.
Adv. Math. Commun., 2018

New cubic self-dual codes of length 54, 60 and 66.
Appl. Algebra Eng. Commun. Comput., 2018

Characterizations of Partially Bent and Plateaued Functions over Finite Fields.
Proceedings of the Arithmetic of Finite Fields - 7th International Workshop, 2018

Construction of Some Codes Suitable for Both Side Channel and Fault Injection Attacks.
Proceedings of the Arithmetic of Finite Fields - 7th International Workshop, 2018

2017
Additive Rank Metric Codes.
IEEE Trans. Inf. Theory, 2017

Structure and performance of generalized quasi-cyclic codes.
Finite Fields Their Appl., 2017

Cyclic subspace codes via subspace polynomials.
Des. Codes Cryptogr., 2017

Hasse-Weil bound for additive cyclic codes.
Des. Codes Cryptogr., 2017

A new class of three-weight linear codes from weakly regular plateaued functions.
CoRR, 2017

On complementary dual additive cyclic codes.
Adv. Math. Commun., 2017

Classification of a sequence family using plateaued functions.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints.
Proceedings of the Coding Theory and Applications - 5th International Castle Meeting, 2017

New Bent Functions from Permutations and Linear Translators.
Proceedings of the Codes, Cryptology and Information Security, 2017

Explicit Characterizations for Plateaued-ness of p-ary (Vectorial) Functions.
Proceedings of the Codes, Cryptology and Information Security, 2017

2016
Explicit maximal and minimal curves over finite fields of odd characteristics.
Finite Fields Their Appl., 2016

A minimum distance bound for quasi-nD-cyclic codes.
Finite Fields Their Appl., 2016

Switchings of semifield multiplications.
Des. Codes Cryptogr., 2016

Further results on rational points of the curve y<sup>q<sup>n</sup></sup>-y=γ x<sup>q<sup>h</sup>+1</sup> - α over 𝔽<sub>q<sup>m</sup></sub>.
Des. Codes Cryptogr., 2016

Further results on fibre products of Kummer covers and curves with many points over finite fields.
Adv. Math. Commun., 2016

Explicit constructions of some non-Gabidulin linear maximum rank distance codes.
Adv. Math. Commun., 2016

A Correction and Improvements of Some Recent Results on Walsh Transforms of Gold Type and Kasami-Welch Type Functions.
Proceedings of the Arithmetic of Finite Fields - 6th International Workshop, 2016

2015
Classes of weak Dembowski-Ostrom polynomials for multivariate quadratic cryptosystems.
J. Math. Cryptol., 2015

Characterisation and enumeration of a class of semi-bent quadratic Boolean functions.
Int. J. Inf. Coding Theory, 2015

Bent and Semi-bent Functions via Linear Translators.
IACR Cryptol. ePrint Arch., 2015

On some bounds on the minimum distance of cyclic codes over finite fields.
Des. Codes Cryptogr., 2015

A construction of weakly and non-weakly regular bent functions over the ring of integers modulo $$p^m$$ p m.
Appl. Algebra Eng. Commun. Comput., 2015

Multiplication in a Galois ring.
Proceedings of the Seventh International Workshop on Signal Design and its Applications in Communications, 2015

Correlation distribution of a new sequence family.
Proceedings of the IEEE International Symposium on Information Theory, 2015

A generalized construction for perfect autocorrelation sequences.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Results on Characterizations of Plateaued Functions in Arbitrary Characteristic.
Proceedings of the Cryptography and Information Security in the Balkans, 2015

2014
Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes.
Theor. Comput. Sci., 2014

On the arithmetic operations over finite fields of characteristic three with low complexity.
J. Comput. Appl. Math., 2014

Hybrid classes of balanced Boolean functions with good cryptographic properties.
Inf. Sci., 2014

Differential Factors: Improved Attacks on SERPENT.
IACR Cryptol. ePrint Arch., 2014

Uniqueness of 𝔽<sub>q</sub>-quadratic perfect nonlinear maps from 𝔽<sub>q<sup>3</sup></sub> to 𝔽<sub>q</sub><sup>2</sup>.
Finite Fields Their Appl., 2014

Finite number of fibre products of Kummer covers and curves with many points over finite fields.
Des. Codes Cryptogr., 2014

On the exact number of solutions of certain linearized equations.
Des. Codes Cryptogr., 2014

On Verification of Restricted Extended Affine Equivalence of Vectorial Boolean Functions.
Proceedings of the Arithmetic of Finite Fields - 5th International Workshop, 2014

L-Polynomials of the Curve đisplaystyle y<sup>q<sup>n</sup></sup>-y=γ x<sup>q<sup>h</sup></sup>+1 - α over 픽<sub>q<sup>m</sup></sub>.
Proceedings of the Arithmetic of Finite Fields - 5th International Workshop, 2014

On Fibre Products of Kummer Curves with Many Rational Points over Finite Fields.
Proceedings of the Coding Theory and Applications, 4th International Castle Meeting, 2014

Non-extendable F<sub>q</sub>-Quadratic Perfect Nonlinear Maps.
Proceedings of the Open Problems in Mathematics and Computational Science, 2014

Rational points of the curve over.
Proceedings of the Applied Algebra and Number Theory, 2014

2013
The Concatenated Structure of Quasi-Cyclic Codes and an Improvement of Jensen's Bound.
IEEE Trans. Inf. Theory, 2013

On the generalisation of special moduli for faster interleaved montgomery modular multiplication.
IET Inf. Secur., 2013

A New Representation of Elements of Binary Fields with Subquadratic Space Complexity Multiplication of Polynomials.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes.
Finite Fields Their Appl., 2013

2012
Modified Redundant Representation for Designing Arithmetic Circuits with Small Complexity.
IEEE Trans. Computers, 2012

On the Polynomial Multiplication in Chebyshev Form.
IEEE Trans. Computers, 2012

A Bound on the Minimum Distance of Quasi-cyclic Codes.
SIAM J. Discret. Math., 2012

Quadratic forms of codimension 2 over finite fields containing F<sub>2</sub> and Artin-Schreier type curves.
Finite Fields Their Appl., 2012

Planarity of products of two linearized polynomials.
Finite Fields Their Appl., 2012

A relation between quasi-cyclic codes and 2-D cyclic codes.
Finite Fields Their Appl., 2012

A new class of quaternary LCZ sequence sets.
Des. Codes Cryptogr., 2012

Nonexistence of Certain Almost p-ary Perfect Sequences.
Proceedings of the Sequences and Their Applications - SETA 2012, 2012

Improvement in Non-linearity of Carlet-Feng Infinite Class of Boolean Functions.
Proceedings of the Cryptology and Network Security, 11th International Conference, 2012

2011
Multiplication of polynomials modulo x<sup>n</sup>.
Theor. Comput. Sci., 2011

Efficient multiplications in F<sub>5<sup>5n</sup></sub> and F<sub>7<sup>7n</sup></sub>.
J. Comput. Appl. Math., 2011

A class of authentication codes with secrecy.
Des. Codes Cryptogr., 2011

Quadratic forms of codimension 2 over certain finite fields of even characteristic.
Cryptogr. Commun., 2011

2010
On multiplication in finite fields.
J. Complex., 2010

On Feedback Functions of Maximum Length Nonlinear Feedback Shift Registers.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

Monomial-like codes
CoRR, 2010

Faster Montgomery Modular Multiplication without Pre-computational Phase For Some Classes of Finite Fields.
Proceedings of the Computer and Information Sciences, 2010

Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity.
Proceedings of the Progress in Cryptology - INDOCRYPT 2010, 2010

2009
Improved Polynomial Multiplication Formulas over $IF<sub>2</sub>$ Using Chinese Remainder Theorem.
IEEE Trans. Computers, 2009

On Hierarchical Threshold Secret Sharing.
IACR Cryptol. ePrint Arch., 2009

Linear complexity over F<sub>q</sub> and over F<sub>q<sup>m</sup></sub> for linear recurring sequences.
Finite Fields Their Appl., 2009

Joint linear complexity of arbitrary multisequences consisting of linear recurring sequences.
Finite Fields Their Appl., 2009

Two generalizations on the minimum Hamming distance of repeated-root constacyclic codes
CoRR, 2009

Joint linear complexity of multisequences consisting of linear recurring sequences.
Cryptogr. Commun., 2009

A note on negacyclic and cyclic codes of length p<sup>s</sup> over a finite field of characteristic p.
Adv. Math. Commun., 2009

Polynomial Multiplication over Finite Fields Using Field Extensions and Interpolation.
Proceedings of the 19th IEEE Symposium on Computer Arithmetic, 2009

The Minimum Hamming Distance of Cyclic Codes of Length 2ps.
Proceedings of the Applied Algebra, 2009

2008
Weil-Serre Type Bounds for Cyclic Codes.
IEEE Trans. Inf. Theory, 2008

Some constructions of (t, m, s)-nets with improved parameters.
Finite Fields Their Appl., 2008

Multidimensional cyclic codes and Artin-Schreier type hypersurfaces over finite fields.
Finite Fields Their Appl., 2008

Curves related to Coulter's maximal curves.
Finite Fields Their Appl., 2008

Systematic authentication codes using additive polynomials.
Des. Codes Cryptogr., 2008

Generalized Joint Linear Complexity of Linear Recurring Multisequences.
Proceedings of the Sequences and Their Applications, 2008

Efficient Multiplication in F<sub>3<sup>kn</sup></sub>, m>=1 and 5<=l<=18.
Proceedings of the Progress in Cryptology, 2008

2007
Cyclic Codes and Reducible Additive Equations.
IEEE Trans. Inf. Theory, 2007

Improved Asymptotic Bounds for Codes Using Distinguished Divisors of Global Function Fields.
SIAM J. Discret. Math., 2007

Further improvements on asymptotic bounds for codes using distinguished divisors.
Finite Fields Their Appl., 2007

Constructions and bounds on linear error-block codes.
Des. Codes Cryptogr., 2007

Gilbert-Varshamov type bounds for linear codes over finite chain rings.
Adv. Math. Commun., 2007

Fibre products of Kummer covers and curves with many points.
Appl. Algebra Eng. Commun. Comput., 2007

2006
Aperiodic and Odd Correlations of Some p-Ary Sequences from Galois Rings.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

Some constructions of systematic authentication codes using galois rings.
Des. Codes Cryptogr., 2006

Improvements on Generalized Hamming Weights of Some Trace Codes.
Des. Codes Cryptogr., 2006

An explicit class of codes with good parameters and their duals.
Discret. Appl. Math., 2006

2005
Improved <i>p</i>-ary Codes and Sequence Families from Galois Rings of Characteristic <i>p</i><sup>2</sup>.
SIAM J. Discret. Math., 2005

Elements of Prescribed Order, Prescribed Traces and Systems of Rational Functions Over Finite Fields.
Des. Codes Cryptogr., 2005

Improved Bounds on Weil Sums over Galois Rings and Homogeneous Weights.
Proceedings of the Coding and Cryptography, International Workshop, 2005

2004
An improvement on the bounds of Weil exponential sums over Galois rings with some applications.
IEEE Trans. Inf. Theory, 2004

Matrix-product constructions of digital nets.
Finite Fields Their Appl., 2004

Improved p-ary Codes and Sequence Families from Galois Rings.
Proceedings of the Sequences and Their Applications, 2004

2003
Constructing linear unequal error protection codes from algebraic curves.
IEEE Trans. Inf. Theory, 2003

2002
Note on Niederreiter-Xing's Propagation Rule for Linear Codes.
Appl. Algebra Eng. Commun. Comput., 2002

1999
Constructing codes from algebraic curves.
IEEE Trans. Inf. Theory, 1999


  Loading...