Maryam Bajalan

2papers

2 Papers

32.2ITMar 19
Some structural properties of mixed orthogonal arrays and their irredundancy

Maryam Bajalan, Peter Boyvalenkov, Ferruh Özbudak

Mixed (asymmetric) orthogonal arrays (MOAs) generalize classical orthogonal arrays by allowing columns over different alphabets. However, their study requires very different structural tools than those used for symmetric orthogonal arrays (OAs), since several key features of the symmetric setting are no longer available in the mixed case, including Euclidean duality, a unique global index, and certain classical bounds. In this paper, we establish three structural results for mixed orthogonal arrays. First, we prove a Singleton-type upper bound and obtain a characterization of MDS and almost-MDS mixed orthogonal arrays. Second, we introduce a trace duality for $\mathbb{F}_q$-linear MOAs over $\prod_{i=1}^{s} \mathbb{F}_{q^{n_i}}$ and establish a correspondence with $\mathbb{F}_q$-linear error-block codes that determines the strength of the MOA via the dual distance of the associated error-block code. Finally, we develop a structural theory of irredundant mixed orthogonal arrays (IrMOAs), motivated by their role in the construction of $t$-uniform and absolutely maximally entangled (AME) quantum states. In the extremal case $t=\lfloor s/2\rfloor$, we prove that $\mathbb{F}_q$-linear IrMOAs with minimum index $1$ (yielding AME states of minimal support) are equivalent to $\mathbb{F}_q$-linear error-block MDS codes.

61.9ITMay 4
Skew polycyclic over finite chain rings associated to trinomials

Maryam Bajalan, Edgar Martínez-Moro, Hassan Ou-azzou

This work studies skew polycyclic codes over finite chain rings defined by central trinomials. For this class of codes, we investigate Hamming equivalence in the non-commutative (skew) setting. We introduce an equivalence relation on the defining trinomials and demonstrate that it admits a group-theoretic characterization in terms of a group of binomials equipped with the Schur multiplication. We determine the conditions under which skew polycyclic codes are Hamming equivalent to those defined by the specific trinomial $x^n-(x^\ell+1)$. This reduces the classification problem for these codes, up to Hamming equivalence, to a canonical case. Finally, we determine the size of the corresponding equivalence class using the decomposition of the unit group of the underlying chain ring.