Minimal and optimal binary codes obtained using \(C_D\)-construction over the non-unital ring \(I\) (Q6146594)

The article under review studies linear codes over the commutative non-unital ring \(I\) (according to the classification from [\textit{B. Fine}, Math. Mag. 66, No. 4, 248--252 (1993; Zbl 0838.16011)] of size four. The codes studied arise from the \(C_D\) construction introduced in [\textit{C. Ding} et al., IEEE Trans. Inf. Theory 53, No. 6, 2229--2235 (2007; Zbl 1310.94178)], where \(D\) is a simplicial complex over \(\mathbb{F}_2^m\). The authors compute the Lee weight distribution of these codes, and they study their binary Gray images. Using this knowledge, they obtain conditions for these images to be self-orthogonal, 1-weight, 2-weight, minimal, or optimal with respect to the Griesmer bound.