Hakan Özadam

According to our database, Hakan Özadam authored at least 9 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

RiboGraph: an interactive visualization system for ribosome profiling data at read length resolution.

Jonathan Chacko, Hakan Özadam, Can Cenik

Bioinform., 2024

2020

RiboFlow, RiboR and RiboPy: an ecosystem for analyzing ribosome profiling data at read length resolution.

Hakan Özadam, Michael Geng, Can Cenik

Bioinform., 2020

2013

Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes.

Sergio R. López-Permouth, Hakan Özadam, Ferruh Özbudak, Steve Szabo

Finite Fields Their Appl., 2013

ASPeak: an abundance sensitive peak detection algorithm for RIP-Seq.

Alper Küçükural, Hakan Özadam, Guramrit Singh, Melissa J. Moore, Can Cenik

Bioinform., 2013

2012

Repeated - root cyclic codes and matrix product codes ; Çok katlı döngüsel kodlar ve matris çarpım kodları.

Hakan Özadam

PhD thesis, 2012

2010

Monomial-like codes

Edgar Martínez-Moro, Hakan Özadam, Ferruh Özbudak, Steve Szabo

CoRR, 2010

2009

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

Hakan Özadam, Ferruh Özbudak

CoRR, 2009

A note on negacyclic and cyclic codes of length p^s over a finite field of characteristic p.

Hakan Özadam, Ferruh Özbudak

Adv. Math. Commun., 2009

The Minimum Hamming Distance of Cyclic Codes of Length 2ps.

Hakan Özadam, Ferruh Özbudak

Proceedings of the Applied Algebra, 2009