加载中…
A code is called -linear if it is the Gray image of a -additive code. For any prime number larger than , the bounds of the rank of -linear codes are given. For each value of the rank and the pairs of rank and the dimension of the kernel of -linear codes, we give detailed construction of the corresponding codes. Finally, as an example, the rank and the dimension of the kernel of -linear codes are studied.

生成讲解博客的中文版本

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