Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="{\"O}zbudak, Ferruh"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes
Ferruh Özbudak
,
Og̑uz Yayla
Theoretical Computer Science
520
, 2014, pp. 111-123
A bound on the minimum distance of quasi-cyclic codes
Cem Güneri
,
Ferruh Özbudak
SIAM Journal on Discrete Mathematics
26
(4), 2012, pp. 1781-1796
Multiplication of polynomials modulo
\mbox x^n
Murat Cenk
,
Ferruh Özbudak
Theoretical Computer Science
412
(29), 2011, pp. 3451-3462
On multiplication in finite fields
Murat Cenk
,
Ferruh Özbudak
Journal of Complexity
26
(2), 2010, pp. 172-186
The minimum Hamming distance of cyclic codes of length
2p^s
Hakan Özadam
,
Ferruh Özbudak
Lecture Notes in Computer Science
5527
, 2009, pp. 92-100
Improved asymptotic bounds for codes using distinguished divisors of global function fields
Harald Niederreiter
,
Ferruh Özbudak
SIAM Journal on Discrete Mathematics
21
(4), 2007, pp. 865-899
Improved
p
-ary codes and sequence families from Galois rings of characteristic
p^2
San Ling
,
Ferruh Özbudak
SIAM Journal on Discrete Mathematics
19
(4), 2005-2006, pp. 1011-1028