Otokar Grosek

Publication Activity (10 Years)

Years Active: 2003-2023
Publications (10 Years): 8

Top Topics

Radon Transform

Binary Matrices

Top Venues

J. Math. Cryptol.

IEEE Trans. Inf. Theory

Publications

Peter Horák, Viliam Hromada, Otokar Grosek
On the Maximum Size of a Prefix Code. IEEE Trans. Inf. Theory 69 (5) (2023)
Viliam Hromada, Otokar Grosek
A Note on the Maximum Size of a Prefix Code. IEEE Access 10 (2022)
Otokar Grosek, Viliam Hromada, Peter Horák
A Cipher Based on Prefix Codes. Sensors 21 (18) (2021)
Eugen Antal, Pavol Zajac, Otokar Grosek
Diplomatic Ciphers Used by Slovak Attaché During the WW2. HistoCrypt (2020)
Otokar Grosek, Eugen Antal, Tomás Fabsic
Remarks on breaking the Vigenère autokey cipher. Cryptologia 43 (6) (2019)
Eugen Antal, Pavol Zajac, Otokar Grosek
Cryptology in the Slovak State During WWII. HistoCrypt (2019)
Tomás Fabsic, Otokar Grosek, Karol Nemoga, Pavol Zajac
On generating invertible circulant binary matrices with a prescribed number of ones. Cryptogr. Commun. 10 (1) (2018)
Eugen Antal, Otokar Grosek, Peter Horák
On a mnemonic construction of permutations. J. Math. Cryptol. 11 (1) (2017)
Peter Horák, Otokar Grosek
A new approach towards the Golomb-Welch conjecture. Eur. J. Comb. 38 (2014)
Otokar Grosek, Stefan Porubský
Coprime solutions to ax≡b (mod n). J. Math. Cryptol. 7 (3) (2013)
Peter Horák, Otokar Grosek
Towards a Solution of the Golomb-Welch Conjecture ? CoRR (2012)
Otokar Grosek, Peter Horák
On quasigroups with few associative triples. Des. Codes Cryptogr. 64 (1-2) (2012)
Otokar Grosek, Peter Horák, Pavol Zajac
On complexity of round transformations. Discret. Math. 309 (18) (2009)
Otokar Grosek, Milan Vojvoda, Róbert Krchnavý
A new matrix test for randomness. Computing 85 (1-2) (2009)
Otokar Grosek, Peter Horák, Tran van Trung
On Non-Polynomial Latin Squares. Des. Codes Cryptogr. 32 (1-3) (2004)
Otokar Grosek, Ladislav Satko, Karol Nemoga
Extremal Generalized S-Boxes. Comput. Artif. Intell. 22 (1) (2003)
Otokar Grosek, Julius Siska
} and its Relation to AES. Comput. Artif. Intell. 22 (5) (2003)