Petr Lisonek

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 15

Top Topics

Affine Transformation

Error Correction

Mathematical Tools

Top Venues

Des. Codes Cryptogr.

Cryptogr. Commun.

Publications

Reza Dastbasteh, Petr Lisonek
New quantum codes from self-dual codes over $\mathbb {F}_4$. Des. Codes Cryptogr. 92 (3) (2024)
Reza Dastbasteh, Petr Lisonek
On the equivalence of linear cyclic and constacyclic codes. Discret. Math. 346 (9) (2023)
Reza Dastbasteh, Petr Lisonek
On the equivalence of linear cyclic and constacyclic codes. CoRR (2022)
Lucien Lapierre, Petr Lisonek
Non-existence results for vectorial bent functions with Dillon exponent. Discret. Appl. Math. 316 (2022)
Reza Dastbasteh, Petr Lisonek
New quantum codes from self-dual codes over F_4. CoRR (2022)
Benjamin Chase, Petr Lisonek
Construction of APN permutations via Walsh zero spaces. Cryptogr. Commun. 14 (6) (2022)
Lucien Lapierre, Petr Lisonek
Non-existence results for vectorial bent functions with Dillon exponent. CoRR (2021)
Benjamin Chase, Petr Lisonek
Construction of APN permutations via Walsh zero spaces. CoRR (2021)
Benjamin Chase, Petr Lisonek
Kim-type APN functions are affine equivalent to Gold functions. Cryptogr. Commun. 13 (6) (2021)
Benjamin Chase, Petr Lisonek
Kim-type APN functions are affine equivalent to Gold functions. CoRR (2020)
Ales Drápal, Petr Lisonek
Maximal nonassociativity via nearfields. Finite Fields Their Appl. 62 (2020)
Petr Lisonek
Maximal nonassociativity via fields. Des. Codes Cryptogr. 88 (12) (2020)
Petr Lisonek
Kochen-Specker sets and Hadamard matrices. Theor. Comput. Sci. 800 (2019)
Petr Lisonek, Layla Trummer
Algorithms for the minimum weight of linear codes. Adv. Math. Commun. 10 (1) (2016)
Lucien Lapierre, Petr Lisonek
On vectorial bent functions with Dillon-type exponents. ISIT (2016)
Petr Lisonek, Layla Trummer
An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm. ICMCTA (2014)
Petr Lisonek, Hui Yi Lu
Bent functions on partial spreads. Des. Codes Cryptogr. 73 (1) (2014)
Petr Lisonek, Vijaykumar Singh
Quantum codes from nearly self-orthogonal quaternary linear codes. Des. Codes Cryptogr. 73 (2) (2014)
Faruk Göloglu, Petr Lisonek, Gary McGuire, Richard Moloney
Binary Kloosterman Sums Modulo 256 and Coefficients of the Characteristic Polynomial. IEEE Trans. Inf. Theory 58 (4) (2012)
Petr Lisonek, Marko J. Moisio
On zeros of Kloosterman sums. Des. Codes Cryptogr. 59 (1-3) (2011)
Petr Lisonek
An Efficient Characterization of a Family of Hyperbent Functions. IEEE Trans. Inf. Theory 57 (9) (2011)
Ales Drápal, Petr Lisonek
Generating spherical Eulerian triangulations. Discret. Math. 310 (8) (2010)
Mahdad Khatirinejad, Petr Lisonek
Linear codes for high payload steganography. Discret. Appl. Math. 157 (5) (2009)
Petr Lisonek
On the Connection between Kloosterman Sums and Elliptic Curves. SETA (2008)
Petr Lisonek, Stefano Marcugini, Fernanda Pambianco
Constructions of small complete arcs with prescribed symmetry. Contributions Discret. Math. 3 (1) (2008)
Petr Lisonek, Joanna Wallis
Small proper double blocking sets in Galois planes of prime order. Discret. Math. 308 (18) (2008)
Kseniya Garaschuk, Petr Lisonek
On binary Kloosterman sums divisible by 3. Des. Codes Cryptogr. 49 (1-3) (2008)
Nicholas J. Cavenagh, Petr Lisonek
Planar Eulerian triangulations are equivalent to spherical Latin bitrades. J. Comb. Theory, Ser. A 115 (1) (2008)
Kseniya Garaschuk, Petr Lisonek
On ternary Kloosterman sums modulo 12. Finite Fields Their Appl. 14 (4) (2008)
Jessica J. Fridrich, Petr Lisonek
Grid Colorings in Steganography. IEEE Trans. Inf. Theory 53 (4) (2007)
Petr Lisonek
Combinatorial families enumerated by quasi-polynomials. J. Comb. Theory, Ser. A 114 (4) (2007)
Jessica J. Fridrich, Petr Lisonek, David Soukal
On Steganographic Embedding Efficiency. Information Hiding (2006)
Mahdad Khatirinejad, Petr Lisonek
Classification and Constructions of Complete Caps in Binary Spaces. Des. Codes Cryptogr. 39 (1) (2006)
Petr Lisonek, Mahdad Khatirinejad
, 2)". Des. Codes Cryptogr. 39 (2) (2006)
Jessica J. Fridrich, Miroslav Goljan, Petr Lisonek, David Soukal
Writing on wet paper. IEEE Trans. Signal Process. 53 (10) (2005)
Jessica J. Fridrich, Miroslav Goljan, Petr Lisonek, David Soukal
Writing on wet paper. Security, Steganography, and Watermarking of Multimedia Contents (2005)
Petr Lisonek, Mahdad Khatirinejad
, 2). Des. Codes Cryptogr. 35 (3) (2005)
Peter B. Borwein, Petr Lisonek, Colin Percival
Computational investigations of the Prouhet-Tarry-Escott Problem. Math. Comput. 72 (244) (2003)
Petr Lisonek, Robert B. Israel
Metric invariants of tetrahedra via polynomial elimination. ISSAC (2000)
Marcin Mazur, Robin Chapman, Petr Lisonek, Robert B. Israel, Murray S. Klamkin
Rigid and Very Rigid Tetrahedra: 10717. Am. Math. Mon. 107 (5) (2000)
Jonathan M. Borwein, Petr Lisonek
Applications of integer relation algorithms. Discret. Math. 217 (1-3) (2000)
Jonathan M. Borwein, David M. Bradley, David John Broadhurst, Petr Lisonek
Combinatorial Aspects of Multiple Zeta Values. Electron. J. Comb. 5 (1998)
Marijn van Eupen, Petr Lisonek
Classification of Some Optimal Ternary Linear Codes of Small Length. Des. Codes Cryptogr. 10 (1) (1997)
Petr Lisonek
New Maximal Two-Distance Sets. J. Comb. Theory, Ser. A 77 (2) (1997)
Petr Lisonek
Local and global majorities revisited. Discret. Math. 146 (1-3) (1995)
Petr Lisonek
Closed Forms for the Number of Polygon Dissections. J. Symb. Comput. 20 (5/6) (1995)
Petr Lisonek, Peter Paule, Volker Strehl
Improvement of the Degree Setting in Gospers's Algorithm. J. Symb. Comput. 16 (3) (1993)