Trace codes over \(\mathbb {Z}_4,\) and Boolean functions (Q2416943)

From MaRDI portal
Revision as of 02:28, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Trace codes over \(\mathbb {Z}_4,\) and Boolean functions
scientific article

    Statements

    Trace codes over \(\mathbb {Z}_4,\) and Boolean functions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 May 2019
    0 references
    Generalizing some recent ideas, the authors construct trace codes over \(\mathbb Z_4\) using the support of a Boolean function, by mapping it to a subset of a Teichmüller set by inverse reduction modulo \(2\). They then study the Lee weight enumerator via the Walsh-Hadamard transform for a family of Boolean functions. Three weight codes are constructed in this setting using bent and semi-bent functions.
    0 references
    Galois rings
    0 references
    Boolean functions
    0 references
    character sums
    0 references

    Identifiers