F. Ozbudak

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

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

cs.IT2009★ 1 cited

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

Hakan Ozadam, Ferruh Ozbudak

We study constacyclic codes, of length $n p^{s}$ and $2 n p^{s}$ , that are generated by the polynomials $(x^{n} + γ)^{ℓ}$ and $(x^{n} - ξ)^{i} (x^{n} + ξ)^{j}$ \ respectively, where $x^{n} + γ$ , $x^…

math.ST2009

Approximation of Bounds on Mixed Level Orthogonal Arrays

Ferruh Ozbudak, Ali Devin Sezer

Mixed level orthogonal arrays are basic structures in experimental design. We develop three algorithms that compute Rao and Gilbert-Varshamov type bounds for mixed level orthogonal…