Construction and Linearity of ZpZp2-Linear Generalized Hadamard Codes
Abstract
The pp2-additive codes are subgroups of pα1 × p2α2, and can be seen as linear codes over p when α2=0, p2-additive codes when α1=0, or 24-additive codes when p=2. A pp2-linear generalized Hadamard (GH) code is a GH code over p which is the Gray map image of a pp2-additive code. In this paper, we generalize some known results for pp2-linear GH codes with p=2 to any p≥ 3 prime when α1 ≠ 0. First, we give a recursive construction of pp2-additive GH codes of type (α1,α2;t1,t2) with t1,t2≥ 1. Then, we show for which types the corresponding pp2-linear GH codes are non-linear over p. Finally, according to some computational results, we see that, unlike 4-linear GH codes, when p≥ 3 prime, the p2-linear GH codes are not included in the family of pp2-linear GH codes with α1 =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.