Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Polynomial approach to construct cyclic subspace codes
Date
2016-08-08
Author
Otal, Kamil
Özbudak, Ferruh
Metadata
Show full item record
Item Usage Stats
23
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/79714
https://network-coding.eu/dubrovnik/talks/otal.pdf
Conference Name
Network Coding and DesignsDubrovnik · April 4 – 8, 2016, 4 - 08 Ağustos 2016
Collections
Department of Mathematics, Conference / Seminar
Suggestions
OpenMETU
Core
Polynomial solutions of the Schrodinger equation for the generalized Woods-Saxon potential
Berkdemir, C; Berkdemir, A; Sever, Ramazan (American Physical Society (APS), 2005-08-01)
The bound state energy eigenvalues and the corresponding eigenfunctions of the generalized Woods-Saxon potential are obtained by means of Nikiforov-Uvarov (NU) method. Certain bound states of the Schrodinger equation for the potential are calculated analytically and the wave functions are found in terms of the Jacobi polynomials. It is shown that the results are in good agreement with those obtained previously.
Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity
AKLEYLEK, SEDAT; Cenk, Murat; Özbudak, Ferruh (2010-12-15)
In this paper, we give a new way to represent certain finite fields GF(2(n)). This representation is based on Charlier polynomials. We show that multiplication in Charlier polynomial representation can be performed with subquadratic space complexity. One can obtain binomial or trinomial irreducible polynomials in Charlier polynomial representation which allows us faster modular reduction over binary fields when there is no desirable such low weight irreducible polynomial in other representations. This repre...
Polynomial solution of non-central potentials
Ikhdair, Sameer M.; Sever, Ramazan (Springer Science and Business Media LLC, 2007-10-01)
We show that the exact energy eigenvalues and eigenfunctions of the Schrodinger equation for charged particles moving in certain class of non-central potentials can be easily calculated analytically in a simple and elegant manner by using Nikiforov and Uvarov (NU) method. We discuss the generalized Coulomb and harmonic oscillator systems. We study the Hartmann Coulomb and the ring-shaped and compound Coulomb plus Aharanov-Bohm potentials as special cases. The results are in exact agreement with other methods.
Polynomial solutions of the Mie-type potential in the D-dimensional Schrodinger equation
IKHDAİR, SAMEER; Sever, Ramazan (2008-04-30)
The polynomial solution of the D-dimensional Schrodinger equation for a special case of Mie potential is obtained with an arbitrary l not equal 0 states. The exact bound state energies and their corresponding wave functions are calculated. The bound state (real) and positive (imaginary) cases are also investigated. In addition, we have simply obtained the results from the solution of the Coulomb potential by an appropriate transformation.
Polynomial Multiplication over Finite Fields using Field Extensions and Interpolation
Cenk, Murat; Özbudak, Ferruh (2009-06-10)
A method for polynomial multiplication over finite fields using field extensions and polynomial interpolation is introduced. The proposed method uses polynomial interpolation as Toom-Cook method together with field extensions. Furthermore, the proposed method can be used when Toom-Cook method cannot be applied directly. Explicit formulae improving the previous results in many cases are obtained.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
K. Otal and F. Özbudak, “Polynomial approach to construct cyclic subspace codes,” presented at the Network Coding and DesignsDubrovnik · April 4 – 8, 2016, 4 - 08 Ağustos 2016, 2016, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/79714.