( en | de | ru )

 

Disambiguation of "Özbudak, Ferruh"

Author of the publication

copydeleteadd this publication to your clipboard
Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes.

, , , and . Finite Fields Their Appl., 19 (1): 16-38 (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ferruh Angi

Ferruh Kocata kin

Ferruh Hâdi Artunç

Özlen Ferruh Erdem

 

Other publications of authors with the same name

Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes, , , and . CoRR, (2012)Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints., and . ICMCTA, volume 10495 of Lecture Notes in Computer Science, page 128-138. Springer, (2017)Nonexistence of Certain Almost p-ary Perfect Sequences., , and . SETA, volume 7280 of Lecture Notes in Computer Science, page 13-24. Springer, (2012)Efficient Multiplication in F3kn, m>=1 and 5<=l<=18., and . AFRICACRYPT, volume 5023 of Lecture Notes in Computer Science, page 406-414. Springer, (2008)Characterisation and enumeration of a class of semi-bent quadratic Boolean functions., , , and . Int. J. Inf. Coding Theory, 3 (1): 39-57 (2015)Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity., , and . INDOCRYPT, volume 6498 of Lecture Notes in Computer Science, page 227-237. Springer, (2010)A new concatenated type construction for LCD codes and isometry codes., , , and . Discret. Math., 341 (3): 830-835 (2018)On Linear Complementary Pairs of Codes., , , , and . IEEE Trans. Inf. Theory, 64 (10): 6583-6589 (2018)On the Parity of Power Permutations., and . IEEE Access, (2021)A note on negacyclic and cyclic codes of length ps over a finite field of characteristic p., and . Adv. Math. Commun., 3 (3): 265-271 (2009)