2 citations · 2 across the 4 of their papers we have counts for
6 papers
On the equivalence of linear cyclic and constacyclic codes
Reza Dastbasteh, Petr Lisonek
We introduce new sufficient conditions for permutation and monomial equivalence of linear cyclic codes over various finite fields. We recall that monomial equivalence and isometric…
New quantum codes from self-dual codes over F_4
Reza Dastbasteh, Petr Lisonek
We present new constructions of binary quantum codes from quaternary linear Hermitian self-dual codes. Our main ingredients for these constructions are nearly self-orthogonal cycli…
Non-existence results for vectorial bent functions with Dillon exponent
Lucien Lapierre, Petr Lisonek
We prove new non-existence results for vectorial monomial Dillon type bent functions mapping the field of order to the field of order . When is odd and …
Construction of APN permutations via Walsh zero spaces
Benjamin Chase, Petr Lisonek
A Walsh zero space (WZ space) for is an -dimensional vector subspace of whose all nonzero elements are Walsh zeros of .…
Kim-type APN functions are affine equivalent to Gold functions
Benjamin Chase, Petr Lisonek
The problem of finding APN permutations of where is even and has been called the Big APN Problem. Li, Li, Helleseth and Qu recently characterized APN…
Maximal nonassociativity via fields
Petr Lisonek
We say that is an associative triple in a quasigroup if . Let denote the number of associative triples in . It is easy to show th…