1 citations · 1 across the 5 of their papers we have counts for
4 papers · 1 filter
Norm-One Torus Decompositions and Decoding of Gashkov-Sidel'nikov Codes
Minjia Shi, Shitao Li, Yuhong Xia +2
Let , let , 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…
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 . Our LP bounds develop in two alternative scenari…
Using multi-orbit cyclic subspace codes for constructing optical orthogonal codes
Ferruh Ozbudak, Paolo Santonastaso, Ferdinando Zullo
We present a new application of multi-orbit cyclic subspace codes to construct large optical orthogonal codes, with the aid of the multiplicative structure of finite fields extensi…
Two generalizations on the minimum Hamming distance of repeated-root constacyclic codes
Hakan Ozadam, Ferruh Ozbudak
We study constacyclic codes, of length and , that are generated by the polynomials and \ respectively, where , $x^…