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

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.