Construction of New Completely Regular Z2Z4-linear Codes from Old
Josep Rifà, Lorena Ronquillo · 2011
Abstract. A code C is said to be Z2Z4-additive if its coordinates can be partitioned into two subsets X and Y, in such a way that the punctured code of C obtained by removing the coordinates outside X (or, respectively, Y) is a binary linear code (respectively, a quaternary linear code). The binary image of a Z2Z4-additive code, through the Gray map, is a Z2Z4-linear code, which is not always linear. Given a perfect Z2Z4-linear code, which is known to be completely regular, some constructions yielding new Z2Z4-linear codes are computed, and the completely regularity of the obtained codes is studied.