Let $G$ be a $p$-group and let $\chi$ be an irreducible character of $G$. The codegree of $\chi$ is given by $|G:\text{ker}(\chi)|/\chi(1)$. If $G$ is a maximal class $p$-group that is normally monomial or has at most three character degrees then the codegrees of $G$ are consecutive powers of $p$. If $|G|=p^n$ and $G$ has consecutive $p$-power codegrees up to $p^{n-1}$ then the nilpotence class of $G$ is at most 2 or $G$ has maximal class.

中文翻译：

---

最大类组的字符代码协议

令 $G$ 是一个 $p$-群，令 $\chi$ 是 $G$ 的一个不可约字符。$\chi$ 的密码由 $|G:\text{ker}(\chi)|/\chi(1)$ 给出。如果 $G$ 是一个极大类 $p$-group，它通常是单项式或最多具有三个字符度数，则 $G$ 的代码格是 $p$ 的连续幂。如果 $|G|=p^n$ 并且 $G$ 有连续的 $p$-power codegrees 高达 $p^{n-1}$ 那么 $G$ 的幂等类至多为 2 或 $G$ 有最大类。