Optimal linear codes over finite rings are of significant interest in coding theory. In this paper, we introduce a method for constructing an infinite class of Lee metric codes of type 4^m₁2^m₂ with length 2ˢ over the ring R = F₂u⟨u²⟩. These codes are constructed by taking a union of certain particular cosets of the ideal I = u (x+1) in the ring S = F₂u⟨x^{2ˢ+1⟩}, for s ≥ 2. We discuss their algebraic structure and demonstrate that these codes are linear with Lee distance 4 and are optimal with respect to the Lee sphere packing bound. Furthermore, we conclude that these codes are even codes with respect to the Lee metric and also provide the complete Lee weight distribution of these codes.
Bansal et al. (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: