Hadamard Full Propelinear Codes of type Q. Rank and Kernel

Abstract

Hadamard full propelinear codes (HFP-codes) are introduced and their equivalence with Hadamard groups is proven (on the other hand, it is already known the equivalence of Hadamard groups with relative $(4n,2,4n,2n)$-difference sets in a group and also with cocyclic Hadamard matrices). We compute the available values for the rank and dimension of the kernel of HFP-codes of type Q and we show that the dimension of the kernel is always 1 or $2$. We also show that when the dimension of the kernel is 2 then the dimension of the kernel of the transposed code is 1 (so, both codes are not equivalent). Finally, we give a construction method such that from an HFP-code of length $4n$, dimension of the kernel $k=2$, and maximum rank $r=2n$, we obtain an HFP-code of double length $8n$, dimension of the kernel $k=2$, and maximum rank $r=4n$.

Submitted to Designs, Codes and Cryptography

References in corpus (1)

• Families of Hadamard Z2Z4Q8-codes

Cited by in corpus (1)

• Circulant Hadamard matrices as HFP-codes of type $C_{4n}\times C_2$