Generalized Hadamard full propelinear codes (Q831152)

From MaRDI portal
Revision as of 17:53, 25 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Generalized Hadamard full propelinear codes
scientific article

    Statements

    Generalized Hadamard full propelinear codes (English)
    0 references
    0 references
    0 references
    0 references
    10 May 2021
    0 references
    In this paper the authors are interested in codes from cocyclic generalized Hadamard matrices. They have introduced a new class of codes and called it generalized Hadamard full propelinear codes. One of the main point of these type of codes is that they can perform better than some linear codes. As a propelinear code is also a group, it is possible to define a generator matrix even if the code is nonlinear. The rows of the generator matrix are the codewords that are associated with the generators of the group. Thus, the code can be built from a few codewords using the propelinear operation associated to the propelinear code. This offers the data storage benefits of a linear code, i.e., we can store just a set of generators and the group operation. As a nice illustration the authors provide interesting examples.
    0 references
    cocycles
    0 references
    generalized Hadamard matrices
    0 references
    difference sets
    0 references
    propelinear codes
    0 references
    rank
    0 references
    kernel
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references