F. Ozbudak

activity

20092026

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

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

collaborators

Showing 2026Show all

2 papers · 1 filter

cs.IT2026

Norm-One Torus Decompositions and Decoding of Gashkov-Sidel'nikov Codes

Minjia Shi, Shitao Li, Yuhong Xia +2

Let $q = 3^{m}$ , let $K = F_{q^{2}}$ , and let \[\mathcal T=\{x\in K^*:\operatorname{N}_{K/\mathbb F_q}(x)=1\}.\] For both cyclic and constacyclic Gashkov-Sidel'nikov codes, we show…

cs.IT2026

New bounds on the covering radius of orthogonal arrays of even strength

Peter Boyvalenkov, Ferruh Ozbudak, Maya Stoyanova

We obtain new linear programming (LP) and constructive bounds for the covering radius of binary orthogonal arrays of strength $2 k$ . Our LP bounds develop in two alternative scenari…