加载中…
Let be a prime and let be positive integers such that and . The enumeration of linear codes of length over which are invariant under the affine linear group ${\rm AGL}(\frac me, {\Bbb F}_{p^e})$ is equivalent to the enumeration of certain ideals in a partially ordered set where ${\mathcal U}={0,1,…,\frac me(p-1)}^e\precee=2$, the enumeration problem was solved in an earlier paper. In the present paper, we consider the cases . We describe methods for enumerating all -invariant linear codes of length over

生成讲解博客的中文版本

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