加载中…
Let be a -additive code of length $n
3{\cal C}C=\Phi({\cal C})$, is a 1-perfect nonlinear code, then cannot be a -cyclic code except for one case of length . Moreover, we give a parity check matrix for this cyclic code. Adding an even parity check coordinate to a -additive 1-perfect code gives an extended 1-perfect code. We also prove that any such code cannot be -cyclic.

生成讲解博客的中文版本

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