It is known that all group codes of dimension at most are permutation equivalent to abelian group codes. We prove that twisted group codes of dimension at most are monomially equivalent either to an abelian group code or to an irreducible constacyclic code, and in the second case we describe the code explicitly by means of a trace map. Monomial equivalence cannot be replaced by permutation equivalence, and the second case cannot be avoided: the ternary tetracode is an ideal of but it is not monomially equivalent to any group code. More generally, we give two infinite families, in dimensions and , of irreducible constacyclic codes which attain the Griesmer bound, whereas every group code with the same length and dimension has smaller minimum distance.

生成讲解博客的中文版本

生成AI智能校验的中文版本