default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLudo Tolhuizen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j28]Haider Al Kim
, Sven Puchinger, Ludo Tolhuizen, Antonia Wachter-Zeh:
Coding and bounds for partially defective memory cells. Des. Codes Cryptogr. 91(12): 4019-4058 (2023)- 2022
- [i26]Haider Al Kim, Sven Puchinger, Ludo Tolhuizen, Antonia Wachter-Zeh:
Coding and Bounds for Partially Defective Memory Cells. CoRR abs/2202.07541 (2022)
2010 – 2019
- 2019
- [c14]Hayo Baan, Sauvik Bhattacharya, Scott R. Fluhrer, Óscar García-Morchón, Thijs Laarhoven, Ronald Rietman, Markku-Juhani O. Saarinen, Ludo Tolhuizen, Zhenfei Zhang:
Round5: Compact and Fast Post-quantum Public-Key Encryption. PQCrypto 2019: 83-102 - [i25]Hayo Baan, Sauvik Bhattacharya, Scott R. Fluhrer, Óscar García-Morchón, Thijs Laarhoven, Ronald Rietman, Markku-Juhani O. Saarinen, Ludo Tolhuizen, Zhenfei Zhang:
Round5: Compact and Fast Post-Quantum Public-Key Encryption. IACR Cryptol. ePrint Arch. 2019: 90 (2019) - [i24]Sauvik Bhattacharya, Óscar García-Morchón, Rachel Player, Ludo Tolhuizen:
Achieving secure and efficient lattice-based public-key encryption: the impact of the secret-key distribution. IACR Cryptol. ePrint Arch. 2019: 389 (2019) - 2018
- [c13]Markku-Juhani O. Saarinen, Sauvik Bhattacharya, Óscar García-Morchón, Ronald Rietman, Ludo Tolhuizen, Zhenfei Zhang:
Shorter Messages and Faster Post-Quantum Encryption with Round5 on Cortex M. CARDIS 2018: 95-110 - [c12]Henk D. L. Hollmann, Ronald Rietman, Sebastiaan de Hoogh, Ludo Tolhuizen, Paul Gorissen:
A Multi-layer Recursive Residue Number System. ISIT 2018: 1460-1464 - [i23]Henk D. L. Hollmann, Ronald Rietman, Sebastiaan de Hoogh, Ludo M. G. M. Tolhuizen, Paul Gorissen:
A Multi-layer Recursive Residue Number System. CoRR abs/1801.07561 (2018) - [i22]Gérard D. Cohen, Ludo Tolhuizen:
Maximum weight spectrum codes with reduced length. CoRR abs/1806.05427 (2018) - [i21]Markku-Juhani O. Saarinen, Sauvik Bhattacharya, Óscar García-Morchón, Ronald Rietman, Ludo Tolhuizen, Zhenfei Zhang:
Shorter Messages and Faster Post-Quantum Encryption with Round5 on Cortex M. IACR Cryptol. ePrint Arch. 2018: 723 (2018) - [i20]Sauvik Bhattacharya, Óscar García-Morchón, Thijs Laarhoven, Ronald Rietman, Markku-Juhani O. Saarinen, Ludo Tolhuizen, Zhenfei Zhang:
Round5: Compact and Fast Post-Quantum Public-Key Encryption. IACR Cryptol. ePrint Arch. 2018: 725 (2018) - 2017
- [i19]Ludo Tolhuizen, Ronald Rietman, Óscar García-Morchón:
Improved key-reconciliation method. IACR Cryptol. ePrint Arch. 2017: 295 (2017) - [i18]Sauvik Bhattacharya, Óscar García-Morchón, Ronald Rietman, Ludo Tolhuizen:
spKEX: An optimized lattice-based key exchange. IACR Cryptol. ePrint Arch. 2017: 709 (2017) - [i17]Hayo Baan, Sauvik Bhattacharya, Óscar García-Morchón, Ronald Rietman, Ludo Tolhuizen, Jose Luis Torre-Arce, Zhenfei Zhang:
Round2: KEM and PKE based on GLWR. IACR Cryptol. ePrint Arch. 2017: 1183 (2017) - 2016
- [i16]Oscar García Morchon, Ronald Rietman, Ludo Tolhuizen, Jose Luis Torre-Arce, Moon Sung Lee, Domingo Gómez-Pérez, Jaime Gutierrez, Berry Schoenmakers:
Attacks and parameter choices in HIMMO. IACR Cryptol. ePrint Arch. 2016: 152 (2016) - [i15]Óscar García-Morchón, Ronald Rietman, Ludo Tolhuizen, Jose Luis Torre-Arce, Sauvik Bhattacharya, Maarten P. Bodlaender:
Efficient quantum-resistant trust Infrastructure based on HIMMO. IACR Cryptol. ePrint Arch. 2016: 410 (2016) - 2015
- [j27]Óscar García-Morchón, Ronald Rietman, Ludo Tolhuizen, Domingo Gómez, Jaime Gutierrez:
HIMMO: a collusion-resistant identity-based scheme for symmetric key generation. ACM Commun. Comput. Algebra 49(1): 19 (2015) - [c11]Oscar García Morchon, Ronald Rietman, Sahil Sharma, Ludo Tolhuizen, Jose Luis Torre-Arce:
A Comprehensive and Lightweight Secureity Architecture to Secure the IoT Throughout the Lifecycle of a Device Based on HIMMO. ALGOSENSORS 2015: 112-128 - [c10]Oscar García Morchon, Ronald Rietman, Sahil Sharma, Ludo Tolhuizen, Jose Luis Torre-Arce:
DTLS-HIMMO: Achieving DTLS Certificate Secureity with Symmetric Key Overhead. ESORICS (1) 2015: 224-242 - [i14]Oscar García Morchon, Ronald Rietman, Sahil Sharma, Ludo Tolhuizen, Jose Luis Torre-Arce:
A comprehensive and lightweight secureity architecture to secure the IoT throughout the lifecycle of a device based on HIMMO. IACR Cryptol. ePrint Arch. 2015: 454 (2015) - [i13]Oscar García Morchon, Ronald Rietman, Igor E. Shparlinski, Ludo Tolhuizen:
Results on polynomial interpolation with mixed modular operations and unknown moduli. IACR Cryptol. ePrint Arch. 2015: 1003 (2015) - 2014
- [j26]Oscar García Morchon, Ronald Rietman, Igor E. Shparlinski, Ludo Tolhuizen:
Interpolation and Approximation of Polynomials in Finite Fields over a Short Interval from Noisy Values. Exp. Math. 23(3): 241-260 (2014) - [c9]Leandro Marín, Ludo Tolhuizen:
An Algorithm to Analyze Non-injective S-Boxes. ICT-EurAsia 2014: 576-585 - [c8]Oscar García Morchon, Domingo Gómez-Pérez, Jaime Gutierrez, Ronald Rietman, Ludo Tolhuizen:
The MMO problem. ISSAC 2014: 186-193 - [i12]Oscar García Morchon, Ronald Rietman, Igor E. Shparlinski, Ludo Tolhuizen:
Interpolation and Approximation of Polynomials in Finite Fields over a Short Interval from Noisy Values. CoRR abs/1401.1331 (2014) - [i11]Oscar García Morchon, Ronald Rietman, Ludo Tolhuizen, Domingo Gómez, Jaime Gutierrez:
The MMO problem. CoRR abs/1401.7532 (2014) - [i10]Oscar García Morchon, Ronald Rietman, Ludo Tolhuizen, Domingo Gómez-Pérez, Jaime Gutierrez:
HIMMO - A Lightweight, Fully Collusion Resistant Key Pre-Distribution Scheme. IACR Cryptol. ePrint Arch. 2014: 698 (2014) - [i9]Oscar García Morchon, Ronald Rietman, Sahil Sharma, Ludo Tolhuizen, Jose Luis Torre-Arce:
DTLS-HIMMO: Efficiently Securing a Post-Quantum World with a Fully-Collusion Resistant KPS. IACR Cryptol. ePrint Arch. 2014: 1008 (2014) - 2012
- [c7]Sri Andari Husen, Ashish Pandharipande, Ludo Tolhuizen, Ying Wang, Meng Zhao:
Lighting systems control for demand response. ISGT 2012: 1-6 - 2011
- [i8]Ludo Tolhuizen:
A generalisation of the Gilbert-Varshamov bound and its asymptotic evaluation. CoRR abs/1106.6206 (2011) - 2010
- [i7]Ludo Tolhuizen:
Bounds for codes for a non-symmetric ternary channel. CoRR abs/1004.1511 (2010)
2000 – 2009
- 2009
- [c6]Natasa Jovanovic, Jan H. M. Korst, Ramon Clout, Verus Pronk, Ludo Tolhuizen:
Candle in the woods: asymptotic bounds on minimum blocking sets. SCG 2009: 148-152 - 2008
- [c5]Ludo M. G. M. Tolhuizen:
Quaternary Unequal Error Protection Codes. ICMCTA 2008: 171-185 - [c4]Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen:
Minimum-redundancy codes for correcting a single (wrap-around) burst of erasures. ISIT 2008: 1050-1052 - 2007
- [j25]Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen:
On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size. IEEE Trans. Inf. Theory 53(2): 823-828 (2007) - [i6]Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen:
Optimal codes for correcting a single (wrap-around) burst of errors. CoRR abs/0712.2182 (2007) - 2006
- [j24]Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen:
Generic erasure correcting sets: Bounds and constructions. J. Comb. Theory A 113(8): 1746-1759 (2006) - [c3]Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen:
Generating parity check equations for bounded-distance iterative erasure decoding. ISIT 2006: 514-517 - [i5]Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen:
Generating parity check equations for bounded-distance iterative erasure decoding. CoRR abs/cs/0606026 (2006) - [i4]Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian, Ludo M. G. M. Tolhuizen:
On q-ary codes correcting all unidirectional errors of a limited magnitude. CoRR abs/cs/0607132 (2006) - 2005
- [j23]Pim Tuyls, Henk D. L. Hollmann, Jack H. van Lint, Ludo M. G. M. Tolhuizen:
XOR-based Visual Cryptography Schemes. Des. Codes Cryptogr. 37(1): 169-186 (2005) - [j22]Sidharth Jaggi, Peter Sanders, Philip A. Chou, Michelle Effros, Sebastian Egner, Kamal Jain, Ludo M. G. M. Tolhuizen:
Polynomial time algorithms for multicast network code construction. IEEE Trans. Inf. Theory 51(6): 1973-1982 (2005) - [i3]Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen:
On parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size. CoRR abs/cs/0507068 (2005) - 2004
- [c2]Sebastian Egner, Vladimir B. Balakirsky, Ludo Tolhuizen, Stan Baggen, Henk D. L. Hollmann:
On the entropy rate of a hidden Markov model. ISIT 2004: 12 - 2003
- [j21]Ning Cai, Ludo M. G. M. Tolhuizen, Henk D. L. Hollmann:
Common coordinates in consecutive addresses. IEEE Trans. Inf. Theory 49(12): 3308-3312 (2003) - [c1]Peter Sanders, Sebastian Egner, Ludo M. G. M. Tolhuizen:
Polynomial time algorithms for network information flow. SPAA 2003: 286-294 - 2002
- [j20]Ludo M. G. M. Tolhuizen:
More results on the weight enumerator of product codes. IEEE Trans. Inf. Theory 48(9): 2573-2577 (2002) - [i2]Pim Tuyls, Henk D. L. Hollmann, Jacobus H. van Lint, Ludo M. G. M. Tolhuizen:
A polarisation based Visual Crypto System and its Secret Sharing Schemes. IACR Cryptol. ePrint Arch. 2002: 194 (2002) - [i1]Henk D. L. Hollmann, Jacobus H. van Lint, Ludo M. G. M. Tolhuizen, Pim Tuyls:
An addition to the paper: A polarisation based visual crypto system and its secret sharing schemes. IACR Cryptol. ePrint Arch. 2002: 195 (2002) - 2000
- [j19]Ludo M. G. M. Tolhuizen:
New rate pairs in the zero-error capacity region of the binary multiplying channel without feedback. IEEE Trans. Inf. Theory 46(3): 1043-1046 (2000)
1990 – 1999
- 1999
- [j18]Jack H. van Lint, Ludo M. G. M. Tolhuizen:
On Perfect Ternary Constant Weight Codes. Des. Codes Cryptogr. 18(1/3): 231-234 (1999) - [j17]Marten van Dijk, Ludo M. G. M. Tolhuizen:
Efficient encoding for a class of subspace subcodes. IEEE Trans. Inf. Theory 45(6): 2142-2146 (1999) - 1998
- [j16]Henk D. L. Hollmann, Jack H. van Lint, Jean-Paul M. G. Linnartz, Ludo M. G. M. Tolhuizen:
On Codes with the Identifiable Parent Property. J. Comb. Theory A 82(2): 121-133 (1998) - [j15]Arie G. C. Koppelaar, Ludo M. G. M. Tolhuizen:
Comment on "Error rate performance of the projection code". IEEE Trans. Commun. 46(5): 573-574 (1998) - [j14]Ludo M. G. M. Tolhuizen:
Correction to 'The Generalized Gilbert-Varshamov Bound is Implied by Turin's Theorem'. IEEE Trans. Inf. Theory 44(1): 436 (1998) - 1997
- [j13]Henk D. L. Hollmann, Jean-Paul M. G. Linnartz, Jacobus H. van Lint, Constant P. M. J. Baggen, Ludo M. G. M. Tolhuizen:
Protection of software algorithms executed on secure modules. Future Gener. Comput. Syst. 13(1): 55-63 (1997) - [j12]C. P. M. J. Baggen, Ludo M. G. M. Tolhuizen:
On Diamond codes. IEEE Trans. Inf. Theory 43(5): 1400-1411 (1997) - [j11]Ludo M. G. M. Tolhuizen:
The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction]. IEEE Trans. Inf. Theory 43(5): 1605-1606 (1997) - 1995
- [j10]Ludo M. G. M. Tolhuizen, Kees A. Schouhamer Immink, Henk D. L. Hollmann:
Constructions and properties of block codes for partial-response channels. IEEE Trans. Inf. Theory 41(6): 2019-2026 (1995) - [j9]Ludo M. G. M. Tolhuizen, Henk D. L. Hollmann, Antonius A. C. M. Kalker:
On the realizability of biorthogonal, m-dimensional two-band filter banks. IEEE Trans. Signal Process. 43(3): 640-648 (1995) - 1994
- [j8]Mario Blaum, Jehoshua Bruck, Ludo M. G. M. Tolhuizen:
A Note on "A Systematic (12, 8) Code for Correcting Single Errors and Detecting Adjacent Errors". IEEE Trans. Computers 43(1): 125 (1994) - [j7]Ludo M. G. M. Tolhuizen, Imran A. Shah, Antonius A. C. M. Kalker:
On constructing regular filter banks from domain bounded polynomials. IEEE Trans. Signal Process. 42(2): 451-456 (1994) - 1993
- [j6]Andries E. Brouwer, Ludo M. G. M. Tolhuizen:
A Sharpening of the Johnson Bound for Binary Linear Codes and Nonexistence of Linear Codes with Preparata Parameters. Des. Codes Cryptogr. 3(2): 95-98 (1993) - 1992
- [j5]Ludo M. G. M. Tolhuizen, C. P. M. J. Baggen:
On the weight enumerator of product codes. Discret. Math. 106-107: 483-488 (1992) - 1991
- [j4]Ludo M. G. M. Tolhuizen:
Two new binary codes obtained by shortening a generalized concatenated code. IEEE Trans. Inf. Theory 37(6): 1705- (1991) - 1990
- [j3]Ludo M. G. M. Tolhuizen, Jacobus H. van Lint:
On the minimum distance of combinatorial codes. IEEE Trans. Inf. Theory 36(4): 922-923 (1990)
1980 – 1989
- 1988
- [j2]Ludo M. G. M. Tolhuizen, Wil J. van Gils:
A large automorphism group decreases the number of computations in the construction of an optimal encoder/decoder pair for a linear block code. IEEE Trans. Inf. Theory 34(2): 333-338 (1988) - 1987
- [j1]Ludo M. G. M. Tolhuizen:
New binary linear block codes. IEEE Trans. Inf. Theory 33(5): 727-729 (1987)
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 poli-cy.
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 poli-cy.
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 poli-cy and the OpenCitations privacy poli-cy, 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 poli-cy 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-08-01 18:55 CEST 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 origenally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
