Rank and pairs of Rank and Dimension of Kernel of ZpZp2-linear codes
Abstract
A code C is called ZpZp2-linear if it is the Gray image of a ZpZp2-additive code. For any prime number p larger than 3, the bounds of the rank of ZpZp2-linear codes are given. For each value of the rank and the pairs of rank and the dimension of the kernel of ZpZp2-linear codes, we give detailed construction of the corresponding codes. Finally, as an example, the rank and the dimension of the kernel of Z5Z25-linear codes are studied.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.