Linear codes over $${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$$

Abstract

In this work, we investigate linear codes over the ring $${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$$ . We first analyze the structure of the ring and then define linear codes over this ring which turns out to be a ring that is not finite chain or principal ideal contrary to the rings that have hitherto been studied in coding theory. Lee weights and Gray maps for these codes are defined by extending on those introduced in works such as Betsumiya et al. (Discret Math 275:43---65, 2004) and Dougherty et al. (IEEE Trans Inf 45:32---45, 1999). We then characterize the $${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$$ -linearity of binary codes under the Gray map and give a main class of binary codes as an example of $${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$$ -linear codes. The duals and the complete weight enumerators for $${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$$ -linear codes are also defined after which MacWilliams-like identities for complete and Lee weight enumerators as well as for the ideal decompositions of linear codes over $${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$$ are obtained.