Certain binary minimal codes constructed using simplicial complexes

In this manuscript, we work over the non-chain ring $\mathcal{R}={\mathbb{F}}_2[u]\mathrm{/}⟨u^3-u⟩$. Let $m\in \mathbb{N}$ and let $L,M,N\subseteq [m]:=\{1,2,\dots ,m\}$. For $X\subseteq [m]$, define ${\mathrm{\Delta }}_X:=\{v\in {\mathbb{F}}_2^m:\text{Supp}(v)\subseteq X\}$ and $D:=(1+u^2)D_1+u^2{D}_2+(u+u^2)D_3$, an ordered finite multiset consisting of elements from ${\mathcal{R}}^m$, where $D_1\in \{{\mathrm{\Delta }}_L,{\mathrm{\Delta }}_L^c\},D_2\in \{{\mathrm{\Delta }}_M,{\mathrm{\Delta }}_M^c\},D_3\in \{{\mathrm{\Delta }}_N,{\mathrm{\Delta }}_N^c\}$. The linear code $C_D$ over $\mathcal{R}$ defined by $\{(v\cdot d{)}_{d\in D}:v\in {\mathcal{R}}^m\}$ is studied for each $D$. Further, we also consider simplicial complexes with two maximal elements in the above work. We study their binary Gray images and the binary subfield-like codes corresponding to a certain ${\mathbb{F}}_2$-functional of $\mathcal{R}$. Sufficient conditions for these binary linear codes to be minimal and self-orthogonal are obtained in each case. Besides, we produce an infinite family of optimal codes with respect to the Griesmer bound. Most of the codes obtained in this manuscript are few-weight codes.