On the Kernel of Z_2^s-Linear Hadamard Codes

The Z_2^s-additive codes are subgroups of Z^n_2^s, and can be seen as a generalization of linear codes over Z_2 and Z_4. A Z_2^s-linear Hadamard code is a binary Hadamard code which is the Gray map image of a Z_2^s-additive code. It is known that the dimension of the kernel can be used to give a complete classification of the Z_4-linear Hadamard codes. In this paper, the kernel of Z_2^s-linear Hadamard codes and its dimension are established for s > 2. Moreover, we prove that this invariant only provides a complete classification for some values of t and s. The exact amount of nonequivalent such codes are given up to t=11 for any s≥ 2, by using also the rank and, in some cases, further computations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/16/2019

On the Kernel of _2^s-Linear Simplex and MacDonald Codes

The _2^s-additive codes are subgroups of ^n_2^s, and can be seen as a ge...
research
03/29/2022

Equivalences among Z_p^s-linear Generalized Hadamard Codes

The _p^s-additive codes of length n are subgroups of _p^s^n, and can be ...
research
04/22/2020

On certain linearized polynomials with high degree and kernel of small dimension

Let f be the F_q-linear map over F_q^2n defined by x x+ax^q^s+bx^q^n+s w...
research
01/28/2017

Efficient Rank Aggregation via Lehmer Codes

We propose a novel rank aggregation method based on converting permutati...
research
01/30/2020

Rank and Kernel of F_p-Additive Generalised Hadamard Codes

A subset of a vector space F_q^n is K-additive if it is a linear space o...
research
04/30/2021

On the trifference problem for linear codes

We prove that perfect 3-hash linear codes in 𝔽_3^n must have dimension a...
research
09/21/2023

Linearity of Gray Codes via Schur Product

We propose an original approach to investigate the linearity of Gray cod...

Please sign up or login with your details

Forgot password? Click here to reset