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
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
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
Canberk İrimağzı
E-mail
canberk@metu.edu.tr
Department
Department of Mathematics
Publications
Theses Advised
Open Courses
Projects
Protecting the Future of Information: LOCO Coding With Error Detection for DNA Data Storage
İrimağzı, Canberk; Uslan, Yusuf; Hareedy, Ahmed (2024-01-01)
From the information-theoretic perspective, DNA strands serve as a storage medium for 4-ary data over the alphabet A,T,G,C. DNA data storage promises formidable information density, long-term durability, and ease of replic...
Probabilistic Design of Multi-Dimensional Spatially-Coupled Codes
İrimağzı, Canberk; Tanrikulu, Ata; Hareedy, Ahmed (2024-01-01)
Because of their excellent asymptotic and finite-length performance, spatially-coupled (SC) codes are a class of low-density parity-check codes that is gaining increasing attention. Multi-dimensional (MD) SC codes are cons...
Sonlu cisimler üzerindeki x^k-cx-d polinomlarının iki uygulaması üzerine ve daha fazlası
İrimağzı, Canberk; Özbudak, Ferruh (Springer, Cham, 2023-1-11)
For integers k∈[2,q−2] coprime to q−1 , we first bound the number of zeroes of the family of polynomials xk−cx−d∈Fq[x] where q=2n such that q−1 is a prime or q=3n such that (q−1)/2 is a prime. This gives us bounds on...
On two applications of polynomials x^k-cx-d over finite fields and more
İrimağzı, Canberk; Özbudak, Ferruh (Springer, Cham, 2023-01-01)
For integers k∈[2,q−2] coprime to q−1 , we first bound the number of zeroes of the family of polynomials xk−cx−d∈Fq[x] where q=2n such that q−1 is a prime or q=3n such that (q−1)/2 is a prime. This gives us bounds on...
F
P
1
N
E
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX