Monomial equivalence of linear codes
= Monomial equivalence of linear codes
Two <linear codes> are monomially equivalent if a permutation of coordinates followed by multiplication of individual coordinates by nonzero <field> elements takes one to the other. This preserves <dimension> and <Hamming distance>. Choosing different representatives for projective parity-check columns produces this equivalence.