\(Z_2Z_4\)-linear codes: rank and kernel (Q977191): Difference between revisions

A \(Z_2Z_4\) additive code is a subgroup of \(Z_2^\alpha Z_4^\beta\). The ambient space is equipped with a non-linear Gray map which transforms Lee weights to Hamming weights. The rank of a binary code is the dimension of the code generated by the vectors of that code. The kernel of a binary code is the set of vectors that leave the code invariant under translation. Lower and upper bounds are established for the rank and the dimension of the kernel of the image of \(Z_2Z_4\) linear codes under the Gray map. For each value between these bounds a \(Z_2Z_4\) code whose image has these values is constructed. Finally, fixing the dimension of the kernel bounds on the rank are given and construction of a code for each pair is given.