Galois LCD codes over mixed alphabets

Abstract: We study (Galois) linear complementary dual codes over mixed alphabets arising from finite chain rings. We give a characterization of when a given code is of We study (Galois) linear complementary dual codes over mixed alphabets arising from finite chain rings. We give a characterization of when a given code is of this type and when it is Galois invariant. Finally, this leads to a study of the Gray image of $\mathbb{F}_p\mathbb{F}_p[\theta]$-linear codes, where $p\in{2; 3}$ and $\theta\neq\theta^2=0$, that provides $\mathbb{F}_p$-linear complementary dual codes.