Improvement of the Degree Setting in Gospers's Algorithm. - Petr Lisonek; Peter Paule; Volker Strehl (J. Symb. Comput., 1993)

Local and global majorities revisited. - Petr Lisonek (Discret. Math., 1995)

Closed Forms for the Number of Polygon Dissections. - Petr Lisonek (J. Symb. Comput., 1995)

Classification of Some Optimal Ternary Linear Codes of Small Length. - Marijn van Eupen; Petr Lisonek (Des. Codes Cryptogr., 1997)

New Maximal Two-Distance Sets. - Petr Lisonek (J. Comb. Theory A, 1997)

Combinatorial Aspects of Multiple Zeta Values. - Jonathan M. Borwein; David M. Bradley; David John Broadhurst; Petr Lisonek (Electron. J. Comb., 1998)

Metric invariants of tetrahedra via polynomial elimination. - Petr Lisonek; Robert B. Israel (ISSAC, 2000)

Applications of integer relation algorithms. - Jonathan M. Borwein; Petr Lisonek (Discret. Math., 2000)

Rigid and Very Rigid Tetrahedra: 10717. - Marcin Mazur; Robin Chapman; Petr Lisonek; Robert B. Israel; Murray S. Klamkin (Am. Math. Mon., 2000)

Computational investigations of the Prouhet-Tarry-Escott Problem. - Peter B. Borwein; Petr Lisonek; Colin Percival (Math. Comput., 2003)

A Family of Complete Caps in PG(n, 2). - Petr Lisonek; Mahdad Khatirinejad (Des. Codes Cryptogr., 2005)

Writing on wet paper. - Jessica J. Fridrich; Miroslav Goljan; Petr Lisonek; David Soukal (IEEE Trans. Signal Process., 2005)

On Steganographic Embedding Efficiency. - Jessica J. Fridrich; Petr Lisonek; David Soukal (Information Hiding, 2006)

Classification and Constructions of Complete Caps in Binary Spaces. - Mahdad Khatirinejad; Petr Lisonek (Des. Codes Cryptogr., 2006)

Erratum for "A Family of Complete Caps in PG(n, 2)". - Petr Lisonek; Mahdad Khatirinejad (Des. Codes Cryptogr., 2006)

Combinatorial families enumerated by quasi-polynomials. - Petr Lisonek (J. Comb. Theory A, 2007)

Grid Colorings in Steganography. - Jessica J. Fridrich; Petr Lisonek (IEEE Trans. Inf. Theory, 2007)

On the Connection between Kloosterman Sums and Elliptic Curves. - Petr Lisonek (SETA, 2008)

Constructions of small complete arcs with prescribed symmetry. - Petr Lisonek; Stefano Marcugini; Fernanda Pambianco (Contributions Discret. Math., 2008)

On binary Kloosterman sums divisible by 3. - Kseniya Garaschuk; Petr Lisonek (Des. Codes Cryptogr., 2008)

Small proper double blocking sets in Galois planes of prime order. - Petr Lisonek; Joanna Wallis (Discret. Math., 2008)

On ternary Kloosterman sums modulo 12. - Kseniya Garaschuk; Petr Lisonek (Finite Fields Their Appl., 2008)

Planar Eulerian triangulations are equivalent to spherical Latin bitrades. - Nicholas J. Cavenagh; Petr Lisonek (J. Comb. Theory A, 2008)

Linear codes for high payload steganography. - Mahdad Khatirinejad; Petr Lisonek (Discret. Appl. Math., 2009)

Generating spherical Eulerian triangulations. - Ales Drápal; Petr Lisonek (Discret. Math., 2010)

On zeros of Kloosterman sums. - Petr Lisonek; Marko J. Moisio (Des. Codes Cryptogr., 2011)

An Efficient Characterization of a Family of Hyperbent Functions. - Petr Lisonek (IEEE Trans. Inf. Theory, 2011)

Binary Kloosterman Sums Modulo 256 and Coefficients of the Characteristic Polynomial. - Faruk Göloglu; Petr Lisonek; Gary McGuire; Richard Moloney (IEEE Trans. Inf. Theory, 2012)

An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm. - Petr Lisonek; Layla Trummer (ICMCTA, 2014)

Bent functions on partial spreads. - Petr Lisonek; Hui Yi Lu (Des. Codes Cryptogr., 2014)

Quantum codes from nearly self-orthogonal quaternary linear codes. - Petr Lisonek; Vijaykumar Singh (Des. Codes Cryptogr., 2014)

On vectorial bent functions with Dillon-type exponents. - Lucien Lapierre; Petr Lisonek (ISIT, 2016)

Algorithms for the minimum weight of linear codes. - Petr Lisonek; Layla Trummer (Adv. Math. Commun., 2016)

Kochen-Specker sets and Hadamard matrices. - Petr Lisonek (Theor. Comput. Sci., 2019)

Maximal nonassociativity via fields. - Petr Lisonek (Des. Codes Cryptogr., 2020)

Maximal nonassociativity via nearfields. - Ales Drápal; Petr Lisonek (Finite Fields Their Appl., 2020)

Kim-type APN functions are affine equivalent to Gold functions. - Benjamin Chase; Petr Lisonek (Cryptogr. Commun., 2021)

Construction of APN permutations via Walsh zero spaces. - Benjamin Chase; Petr Lisonek (Cryptogr. Commun., 2022)

New quantum codes from self-dual codes over F_4. - Reza Dastbasteh; Petr Lisonek (CoRR, 2022)

Non-existence results for vectorial bent functions with Dillon exponent. - Lucien Lapierre; Petr Lisonek (Discret. Appl. Math., 2022)

On the equivalence of linear cyclic and constacyclic codes. - Reza Dastbasteh; Petr Lisonek (Discret. Math., 2023)

New quantum codes from self-dual codes over $ mathbb {F}_4$. - Reza Dastbasteh; Petr Lisonek (Des. Codes Cryptogr., 2024)

Kochen-Specker sets in four-dimensional spaces. - Brandon Elford; Petr Lisonek (Quantum Inf. Comput., 2024)

Additive twisted codes: new distance bounds and infinite families of quantum codes. - Reza Dastbasteh; Petr Lisonek (Des. Codes Cryptogr., 2025)