Canberk İrimağzı

E-mail

canberk@metu.edu.tr

Department

Department of Mathematics

LOCO Codes Can Correct as Well: Error-Correction Constrained Coding for DNA Data Storage İrimağzı, Canberk; Hareedy, Ahmed (2025-01-01) As a medium for cold data storage, DNA stands out as it promises significant gains in storage capacity and lifetime. However, it comes with its own data processing challenges to overcome. Constrained codes over the DNA alp...
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...
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...
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...

Citation Formats