Rank and pairs of Rank and Dimension of Kernel of -linear codes
arXiv:2207.12613
Abstract
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.
arXiv admin note: substantial text overlap with arXiv:2205.13981