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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.