Welcome to Simon Fraser University
You have reached this page because we have detected you have a browser that is not supported by our web site and its stylesheets. We are happy to bring you here a text version of the SFU site. It offers you all the site's links and info, but without the graphics.
You may be able to update your browser and take advantage of the full graphical website. This could be done FREE at one of the following links, depending on your computer and operating system.
Or you may simply continue with the text version.

*Windows:*
FireFox (Recommended) http://www.mozilla.com/en-US/firefox/
Opera http://www.opera.com/

*Macintosh OSX:*
FireFox (Recommended) http://www.mozilla.com/en-US/firefox/
Opera http://www.opera.com/

*Macintosh OS 8.5-9.22:*
The only currently supported browser that we know of is iCAB. This is a free browser to download and try, but there is a cost to purchase it.
http://www.icab.de/index.html
Close x
Searching... Please wait...

Petr Lisonek

Associate Professor

PhD Computer Science · Johannes Kepler University · 1994

tel  778.782.3666
fax  778.782.4947
plisonek@math.sfu.ca
office  SC K10526

Personal Website

Research Interests

  1. Finite geometries and linear codes.
    Geometric structures (such as caps and blocking sets) in finite Galois geometries PG(n,q). Applications in digital communication (error-correcting codes) and in statistical experimental design. Algebraic coding theory (finite fields, exponential sums).
  2. Combinatorial enumeration.
    Generating functions. Counting lattice points in polytopes and applications to enumeration of various combinatorial structures.
  3. Steganography (science of information hiding).
    Steganography based on linear covering codes. Average distance to code - the numerical invariant that measures the appropriateness of a code for the steganography application. Classification of optimal codes with respect to this invariant. Connections to graph colouring problems (domatically full graphs).
  4. Computation
    Computational aspects of the topics listed above. Isomorph-free generation of combinatorial structures. Constructing structures with prescribed automorphism groups.