-additive cyclic codes: kernel and rank
arXiv:2206.14201
Abstract
A code is called -linear if it's the Gray image of the -additive code . In this paper, the rank and the dimension of the kernel of are studied. Both of the codes and are proven -additive cyclic codes, and their generator polynomials are determined. Finally, accurate values of rank and the dimension of the kernel of some classes of -additive cyclic codes are considered.
arXiv commentarXiv admin note: text overlap with arXiv:2206.13810