Equivalences among \(\mathbb{Z}_{2^s} \)-linear Hadamard codes (Q2286582)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Equivalences among \(\mathbb{Z}_{2^s} \)-linear Hadamard codes
scientific article

    Statements

    Equivalences among \(\mathbb{Z}_{2^s} \)-linear Hadamard codes (English)
    0 references
    0 references
    0 references
    22 January 2020
    0 references
    A binary code of length \(n\), cardinality \(2n\) and minimum distnce \(\frac{n}{2}\) is a Hadamard code. These codes are canonically connected to Hadamard matrices. A \(Z_{2^s}\) linear Hadamard code is a binary Hadamard code which is the image of a \(Z_{2^s}\)-additive code under Carlet's Gray map. For codes of length \(2^t\), \(t \leq 11\), the authors show that the codes that are permutation equivalent are those that have the same rank and dimension of the kernel, thus improving the known classification. They show that the rank and the dimension of the kernel gives a full classification of \(Z_{2^s}\) linear Hadamard codes of length \(2^t\) with \(s\) equal to \(2\) or \(3\).
    0 references
    rank
    0 references
    kernel
    0 references
    Hadamard code
    0 references
    \(\mathbb{Z}_{2^s}\)-additive code
    0 references
    Gray map
    0 references
    classification
    0 references
    0 references
    0 references

    Identifiers