Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Petr Lisoněk"'
Autor:
Reza Dastbasteh, Petr Lisoněk
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 equivalence are the same relation for linear codes over finite fields
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::80ac0cca7aae9a30549b2585af5e54e6
http://arxiv.org/abs/2211.00897
http://arxiv.org/abs/2211.00897
Autor:
Lucien Lapierre, Petr Lisoněk
We prove new non-existence results for vectorial monomial Dillon type bent functions mapping the field of order $2^{2m}$ to the field of order $2^{m/3}$. When $m$ is odd and $m>3$ we show that there are no such functions. When $m$ is even we derive a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92d2aff5d675ca2a2c82f41562115c81
http://arxiv.org/abs/2110.15585
http://arxiv.org/abs/2110.15585
Autor:
Benjamin Chase, Petr Lisoněk
A Walsh zero space (WZ space) for $f:F_{2^n}\rightarrow F_{2^n}$ is an $n$-dimensional vector subspace of $F_{2^n}\times F_{2^n}$ whose all nonzero elements are Walsh zeros of $f$. We provide several theoretical and computer-free constructions of WZ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a1c927a179ae1e808acfeb19387a56bf
http://arxiv.org/abs/2110.15582
http://arxiv.org/abs/2110.15582
Autor:
Petr Lisoněk
Publikováno v:
Theoretical Computer Science. 800:142-145
We introduce a new class of complex Hadamard matrices which have not been studied previously. We use these matrices to construct a new infinite family of parity proofs of the Kochen-Specker theorem. We show that the recently discovered simple parity
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8faef976c0f1084ea16255c3262f8d9f
https://doi.org/10.1016/j.tcs.2019.10.021
https://doi.org/10.1016/j.tcs.2019.10.021
Autor:
Petr Lisoněk
We say that $(x,y,z)\in Q^3$ is an associative triple in a quasigroup $Q(*)$ if $(x*y)*z=x*(y*z)$. Let $a(Q)$ denote the number of associative triples in $Q$. It is easy to show that $a(Q)\ge |Q|$, and we call the quasigroup maximally nonassociative
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::917df7f41369d5fc917f5fb55218aa63
http://arxiv.org/abs/1910.09825
http://arxiv.org/abs/1910.09825
Autor:
Petr Lisoněk, Layla Trummer
Publikováno v:
Advances in Mathematics of Communications. 10:195-207
We outline the algorithm for computing the minimum weight of a linear code over a finite field that was invented by A.~Brouwer and later extended by K.-H. Zimmermann. We show that matroid partitioning algorithms can be used to efficiently find a favo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::716c566bfedd489f3695b10b826efecb
https://doi.org/10.3934/amc.2016.10.195
https://doi.org/10.3934/amc.2016.10.195
Autor:
Aleš Drápal, Petr Lisoněk
Publikováno v:
Finite Fields and Their Applications. 62:101610
We say that ( x , y , z ) ∈ Q 3 is an associative triple in a quasigroup Q ( ⁎ ) if ( x ⁎ y ) ⁎ z = x ⁎ ( y ⁎ z ) . It is easy to show that the number of associative triples in Q is at least | Q | , and it was conjectured that quasigroups
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9cba12a23d9eb6171c8a48cf92a34394
https://doi.org/10.1016/j.ffa.2019.101610
https://doi.org/10.1016/j.ffa.2019.101610
Autor:
Petr Lisoněk
Publikováno v:
Contemporary Mathematics. :125-130
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6be73c857fd948ddb1b42017c45c887f
https://doi.org/10.1090/conm/574/11421
https://doi.org/10.1090/conm/574/11421
Autor:
Kseniya Garaschuk, Petr Lisoněk
Publikováno v:
Finite Fields and Their Applications. 14:1083-1090
Let K(a) denote the Kloosterman sum on F"3"^"m. It is easy to see that K(a)=2(mod3) for all a@?F"3"^"m. We completely characterize those a@?F"3"^"m for which K(a)=1(mod2), K(a)=0(mod4) and K(a)=2(mod4). The simplicity of the characterization allows u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2fafaef41a5711436358c4346505d4c7
https://doi.org/10.1016/j.ffa.2008.07.002
https://doi.org/10.1016/j.ffa.2008.07.002
This book constitutes the proceedings of the 20th International Conference on Selected Areas in Cryptography, SAC 2013, held in Burnaby, Canada, in August 2013. The 26 papers presented in this volume were carefully reviewed and selected from 98 submi