default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPetr Lisonek
Person information
- affiliation: Simon Fraser University, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j37]Reza Dastbasteh
, Petr Lisonek:
New quantum codes from self-dual codes over $\mathbb {F}_4$. Des. Codes Cryptogr. 92(3): 787-801 (2024)- [j36]Brandon Elford, Petr Lisonek:
Kochen-Specker sets in four-dimensional spaces. Quantum Inf. Comput. 24(13&14): 1157-1167 (2024) - 2023
- [j35]Reza Dastbasteh, Petr Lisonek:
On the equivalence of linear cyclic and constacyclic codes. Discret. Math. 346(9): 113489 (2023) - 2022
- [j34]Benjamin Chase, Petr Lisonek:
Construction of APN permutations via Walsh zero spaces. Cryptogr. Commun. 14(6): 1345-1357 (2022) - [j33]Lucien Lapierre, Petr Lisonek:
Non-existence results for vectorial bent functions with Dillon exponent. Discret. Appl. Math. 316: 71-74 (2022) - [i5]Reza Dastbasteh, Petr Lisonek:
New quantum codes from self-dual codes over F_4. CoRR abs/2211.00891 (2022) - [i4]Reza Dastbasteh, Petr Lisonek:
On the equivalence of linear cyclic and constacyclic codes. CoRR abs/2211.00897 (2022) - 2021
- [j32]Benjamin Chase, Petr Lisonek:
Kim-type APN functions are affine equivalent to Gold functions. Cryptogr. Commun. 13(6): 981-993 (2021) - [i3]Benjamin Chase, Petr Lisonek:
Construction of APN permutations via Walsh zero spaces. CoRR abs/2110.15582 (2021) - [i2]Lucien Lapierre, Petr Lisonek:
Non-existence results for vectorial bent functions with Dillon exponent. CoRR abs/2110.15585 (2021) - 2020
- [j31]Petr Lisonek:
Maximal nonassociativity via fields. Des. Codes Cryptogr. 88(12): 2521-2530 (2020) - [j30]Ales Drápal, Petr Lisonek:
Maximal nonassociativity via nearfields. Finite Fields Their Appl. 62: 101610 (2020) - [i1]Benjamin Chase, Petr Lisonek:
Kim-type APN functions are affine equivalent to Gold functions. CoRR abs/2009.05937 (2020)
2010 – 2019
- 2019
- [j29]Petr Lisonek:
Kochen-Specker sets and Hadamard matrices. Theor. Comput. Sci. 800: 142-145 (2019) - 2016
- [j28]Petr Lisonek, Layla Trummer:
Algorithms for the minimum weight of linear codes. Adv. Math. Commun. 10(1): 195-207 (2016) - [c6]Lucien Lapierre, Petr Lisonek:
On vectorial bent functions with Dillon-type exponents. ISIT 2016: 490-494 - 2014
- [j27]Petr Lisonek, Hui Yi Lu:
Bent functions on partial spreads. Des. Codes Cryptogr. 73(1): 209-216 (2014) - [j26]Petr Lisonek, Vijaykumar Singh:
Quantum codes from nearly self-orthogonal quaternary linear codes. Des. Codes Cryptogr. 73(2): 417-424 (2014) - [c5]Petr Lisonek, Layla Trummer:
An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm. ICMCTA 2014: 255-262 - [e1]Tanja Lange, Kristin E. Lauter, Petr Lisonek:
Selected Areas in Cryptography - SAC 2013 - 20th International Conference, Burnaby, BC, Canada, August 14-16, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8282, Springer 2014, ISBN 978-3-662-43413-0 [contents] - 2012
- [j25]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): 2516-2523 (2012) - 2011
- [j24]Petr Lisonek, Marko J. Moisio:
On zeros of Kloosterman sums. Des. Codes Cryptogr. 59(1-3): 223-230 (2011) - [j23]Petr Lisonek:
An Efficient Characterization of a Family of Hyperbent Functions. IEEE Trans. Inf. Theory 57(9): 6010-6014 (2011) - 2010
- [j22]Ales Drápal, Petr Lisonek:
Generating spherical Eulerian triangulations. Discret. Math. 310(8): 1403-1405 (2010)
2000 – 2009
- 2009
- [j21]Mahdad Khatirinejad, Petr Lisonek:
Linear codes for high payload steganography. Discret. Appl. Math. 157(5): 971-981 (2009) - 2008
- [j20]Petr Lisonek, Stefano Marcugini, Fernanda Pambianco:
Constructions of small complete arcs with prescribed symmetry. Contributions Discret. Math. 3(1) (2008) - [j19]Kseniya Garaschuk, Petr Lisonek:
On binary Kloosterman sums divisible by 3. Des. Codes Cryptogr. 49(1-3): 347-357 (2008) - [j18]Petr Lisonek, Joanna Wallis:
Small proper double blocking sets in Galois planes of prime order. Discret. Math. 308(18): 4052-4056 (2008) - [j17]Kseniya Garaschuk, Petr Lisonek:
On ternary Kloosterman sums modulo 12. Finite Fields Their Appl. 14(4): 1083-1090 (2008) - [j16]Nicholas J. Cavenagh, Petr Lisonek:
Planar Eulerian triangulations are equivalent to spherical Latin bitrades. J. Comb. Theory A 115(1): 193-197 (2008) - [c4]Petr Lisonek:
On the Connection between Kloosterman Sums and Elliptic Curves. SETA 2008: 182-187 - 2007
- [j15]Petr Lisonek:
Combinatorial families enumerated by quasi-polynomials. J. Comb. Theory A 114(4): 619-630 (2007) - [j14]Jessica J. Fridrich, Petr Lisonek:
Grid Colorings in Steganography. IEEE Trans. Inf. Theory 53(4): 1547-1549 (2007) - 2006
- [j13]Mahdad Khatirinejad, Petr Lisonek:
Classification and Constructions of Complete Caps in Binary Spaces. Des. Codes Cryptogr. 39(1): 17-31 (2006) - [j12]Petr Lisonek, Mahdad Khatirinejad:
Erratum for "A Family of Complete Caps in PG(n, 2)". Des. Codes Cryptogr. 39(2): 307 (2006) - [c3]Jessica J. Fridrich, Petr Lisonek, David Soukal:
On Steganographic Embedding Efficiency. Information Hiding 2006: 282-296 - 2005
- [j11]Petr Lisonek, Mahdad Khatirinejad:
A Family of Complete Caps in PG(n, 2). Des. Codes Cryptogr. 35(3): 259-270 (2005) - [j10]Jessica J. Fridrich, Miroslav Goljan, Petr Lisonek, David Soukal:
Writing on wet paper. IEEE Trans. Signal Process. 53(10): 3923-3935 (2005) - [c2]Jessica J. Fridrich, Miroslav Goljan, Petr Lisonek, David Soukal:
Writing on wet paper. Security, Steganography, and Watermarking of Multimedia Contents 2005: 328-340 - 2003
- [j9]Peter B. Borwein, Petr Lisonek, Colin Percival:
Computational investigations of the Prouhet-Tarry-Escott Problem. Math. Comput. 72(244): 2063-2070 (2003) - 2000
- [j8]Jonathan M. Borwein, Petr Lisonek:
Applications of integer relation algorithms. Discret. Math. 217(1-3): 65-82 (2000) - [j7]Marcin Mazur, Robin Chapman, Petr Lisonek, Robert B. Israel, Murray S. Klamkin:
Rigid and Very Rigid Tetrahedra: 10717. Am. Math. Mon. 107(5): 466-467 (2000) - [c1]Petr Lisonek, Robert B. Israel:
Metric invariants of tetrahedra via polynomial elimination. ISSAC 2000: 217-219
1990 – 1999
- 1998
- [j6]Jonathan M. Borwein, David M. Bradley, David John Broadhurst, Petr Lisonek:
Combinatorial Aspects of Multiple Zeta Values. Electron. J. Comb. 5 (1998) - 1997
- [j5]Marijn van Eupen, Petr Lisonek:
Classification of Some Optimal Ternary Linear Codes of Small Length. Des. Codes Cryptogr. 10(1): 63-84 (1997) - [j4]Petr Lisonek:
New Maximal Two-Distance Sets. J. Comb. Theory A 77(2): 318-338 (1997) - 1995
- [j3]Petr Lisonek:
Local and global majorities revisited. Discret. Math. 146(1-3): 153-158 (1995) - [j2]Petr Lisonek:
Closed Forms for the Number of Polygon Dissections. J. Symb. Comput. 20(5/6): 595-601 (1995) - 1993
- [j1]Petr Lisonek, Peter Paule, Volker Strehl:
Improvement of the Degree Setting in Gospers's Algorithm. J. Symb. Comput. 16(3): 243-258 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
