Petr Lisonek

Orcid: 0000-0002-5083-0083

Affiliations:
  • Simon Fraser University, Canada


According to our database1, Petr Lisonek authored at least 42 papers between 1993 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
New quantum codes from self-dual codes over $\mathbb {F}_4$.
Des. Codes Cryptogr., March, 2024

2023
On the equivalence of linear cyclic and constacyclic codes.
Discret. Math., September, 2023

2022
Non-existence results for vectorial bent functions with Dillon exponent.
Discret. Appl. Math., 2022

New quantum codes from self-dual codes over F_4.
CoRR, 2022

Construction of APN permutations via Walsh zero spaces.
Cryptogr. Commun., 2022

2021
Kim-type APN functions are affine equivalent to Gold functions.
Cryptogr. Commun., 2021

2020
Maximal nonassociativity via nearfields.
Finite Fields Their Appl., 2020

Maximal nonassociativity via fields.
Des. Codes Cryptogr., 2020

2019
Kochen-Specker sets and Hadamard matrices.
Theor. Comput. Sci., 2019

2016
Algorithms for the minimum weight of linear codes.
Adv. Math. Commun., 2016

On vectorial bent functions with Dillon-type exponents.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2014
Quantum codes from nearly self-orthogonal quaternary linear codes.
Des. Codes Cryptogr., 2014

Bent functions on partial spreads.
Des. Codes Cryptogr., 2014

An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm.
Proceedings of the Coding Theory and Applications, 4th International Castle Meeting, 2014

2012
Binary Kloosterman Sums Modulo 256 and Coefficients of the Characteristic Polynomial.
IEEE Trans. Inf. Theory, 2012

2011
An Efficient Characterization of a Family of Hyperbent Functions.
IEEE Trans. Inf. Theory, 2011

On zeros of Kloosterman sums.
Des. Codes Cryptogr., 2011

2010
Generating spherical Eulerian triangulations.
Discret. Math., 2010

2009
Linear codes for high payload steganography.
Discret. Appl. Math., 2009

2008
Planar Eulerian triangulations are equivalent to spherical Latin bitrades.
J. Comb. Theory A, 2008

On ternary Kloosterman sums modulo 12.
Finite Fields Their Appl., 2008

Small proper double blocking sets in Galois planes of prime order.
Discret. Math., 2008

On binary Kloosterman sums divisible by 3.
Des. Codes Cryptogr., 2008

Constructions of small complete arcs with prescribed symmetry.
Contributions Discret. Math., 2008

On the Connection between Kloosterman Sums and Elliptic Curves.
Proceedings of the Sequences and Their Applications, 2008

2007
Grid Colorings in Steganography.
IEEE Trans. Inf. Theory, 2007

Combinatorial families enumerated by quasi-polynomials.
J. Comb. Theory A, 2007

2006
Erratum for "A Family of Complete Caps in PG(<i>n</i>, 2)".
Des. Codes Cryptogr., 2006

Classification and Constructions of Complete Caps in Binary Spaces.
Des. Codes Cryptogr., 2006

On Steganographic Embedding Efficiency.
Proceedings of the Information Hiding, 8th International Workshop, 2006

2005
Writing on wet paper.
IEEE Trans. Signal Process., 2005

A Family of Complete Caps in PG(<i>n</i>, 2).
Des. Codes Cryptogr., 2005

2003
Computational investigations of the Prouhet-Tarry-Escott Problem.
Math. Comput., 2003

2000
Rigid and Very Rigid Tetrahedra: 10717.
Am. Math. Mon., 2000

Applications of integer relation algorithms.
Discret. Math., 2000

Metric invariants of tetrahedra via polynomial elimination.
Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

1998
Combinatorial Aspects of Multiple Zeta Values.
Electron. J. Comb., 1998

1997
New Maximal Two-Distance Sets.
J. Comb. Theory A, 1997

Classification of Some Optimal Ternary Linear Codes of Small Length.
Des. Codes Cryptogr., 1997

1995
Closed Forms for the Number of Polygon Dissections.
J. Symb. Comput., 1995

Local and global majorities revisited.
Discret. Math., 1995

1993
Improvement of the Degree Setting in Gospers's Algorithm.
J. Symb. Comput., 1993


  Loading...