The following pages link to Petr Lisoněk (Q259291):
Displaying 47 items.
- Algorithms for the minimum weight of linear codes (Q259293) (← links)
- Quantum codes from nearly self-orthogonal quaternary linear codes (Q398946) (← links)
- Classification of some optimal ternary linear codes of small length (Q676693) (← links)
- Caps with free pairs of points (Q860225) (← links)
- Combinatorial families enumerated by quasi-polynomials (Q880005) (← links)
- Small proper double blocking sets in Galois planes of prime order (Q941328) (← links)
- On ternary Kloosterman sums modulo 12 (Q958621) (← links)
- Generating spherical Eulerian triangulations (Q966008) (← links)
- On binary Kloosterman sums divisible by 3 (Q1009054) (← links)
- Linear codes for high payload steganography (Q1028424) (← links)
- Combinatorial aspects of multiple zeta values (Q1128361) (← links)
- Improvement of the degree setting in Gosper's algorithm (Q1314432) (← links)
- New maximal two-distance sets (Q1352878) (← links)
- Finite metric spaces of strictly negative type (Q1377510) (← links)
- Local and global majorities revisited (Q1903726) (← links)
- Closed forms for the number of polygon dissections (Q1918480) (← links)
- Applications of integer relation algorithms (Q1978174) (← links)
- Construction of APN permutations via Walsh zero spaces (Q2096658) (← links)
- Kim-type APN functions are affine equivalent to Gold functions (Q2121022) (← links)
- Non-existence results for vectorial bent functions with Dillon exponent (Q2143048) (← links)
- Maximal nonassociativity via fields (Q2211334) (← links)
- Maximal nonassociativity via nearfields (Q2302570) (← links)
- Kochen-Specker sets and Hadamard matrices (Q2333831) (← links)
- On zeros of Kloosterman sums (Q2430691) (← links)
- Large caps with free pairs in dimensions five and six (Q2455070) (← links)
- Planar Eulerian triangulations are equivalent to spherical Latin bitrades (Q2469205) (← links)
- A family of complete caps in \(\mathbf{PG}(n,2)\) (Q2486865) (← links)
- Classification and constructions of complete caps in binary spaces (Q2491283) (← links)
- Bent functions on partial spreads (Q2510664) (← links)
- (Q3033346) (← links)
- Binary caps with many free pairs of points (Q3419702) (← links)
- Metric invariants of tetrahedra via polynomial elimination (Q3454767) (← links)
- An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm (Q3460472) (← links)
- Grid Colorings in Steganography (Q3548200) (← links)
- (Q3558614) (← links)
- On the Connection between Kloosterman Sums and Elliptic Curves (Q3600439) (← links)
- (Q4013088) (← links)
- Computational investigations of the Prouhet-Tarry-Escott Problem (Q4417179) (← links)
- Special values of multiple polylogarithms (Q4523172) (← links)
- (Q4848782) (← links)
- Binary Kloosterman Sums Modulo 256 and Coefficients of the Characteristic Polynomial (Q5272031) (← links)
- An Efficient Characterization of a Family of Hyperbent Functions (Q5272377) (← links)
- Writing on wet paper (Q5356725) (← links)
- (Q5488389) (← links)
- Identities for Kloosterman sums and modular curves (Q5500543) (← links)
- On the equivalence of linear cyclic and constacyclic codes (Q6098080) (← links)
- New quantum codes from self-dual codes over \(\mathbb{F}_4\) (Q6130618) (← links)
