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.
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.