Ludo M. G. M. Tolhuizen

According to our database1, Ludo M. G. M. Tolhuizen
  • authored at least 35 papers between 1987 and 2018.
  • has a "Dijkstra number"2 of four.



In proceedings 
PhD thesis 




A Multi-layer Recursive Residue Number System.
CoRR, 2018

Minimum-redundancy codes for correcting a single (wrap-around) burst of erasures.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Quaternary Unequal Error Protection Codes.
Proceedings of the Coding Theory and Applications, Second International Castle Meeting, 2008

On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size.
IEEE Trans. Information Theory, 2007

Optimal codes for correcting a single (wrap-around) burst of errors
CoRR, 2007

Generic erasure correcting sets: Bounds and constructions.
J. Comb. Theory, Ser. A, 2006

On q-ary codes correcting all unidirectional errors of a limited magnitude
CoRR, 2006

Generating parity check equations for bounded-distance iterative erasure decoding
CoRR, 2006

Polynomial time algorithms for multicast network code construction.
IEEE Trans. Information Theory, 2005

XOR-based Visual Cryptography Schemes.
Des. Codes Cryptography, 2005

On parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size
CoRR, 2005

Common coordinates in consecutive addresses.
IEEE Trans. Information Theory, 2003

Polynomial time algorithms for network information flow.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

More results on the weight enumerator of product codes.
IEEE Trans. Information Theory, 2002

A polarisation based Visual Crypto System and its Secret Sharing Schemes.
IACR Cryptology ePrint Archive, 2002

An addition to the paper: A polarisation based visual crypto system and its secret sharing schemes.
IACR Cryptology ePrint Archive, 2002

New rate pairs in the zero-error capacity region of the binary multiplying channel without feedback.
IEEE Trans. Information Theory, 2000

Efficient encoding for a class of subspace subcodes.
IEEE Trans. Information Theory, 1999

On Perfect Ternary Constant Weight Codes.
Des. Codes Cryptography, 1999

Correction to 'The Generalized Gilbert-Varshamov Bound is Implied by Turin's Theorem'.
IEEE Trans. Information Theory, 1998

Comment on "Error rate performance of the projection code".
IEEE Trans. Communications, 1998

On Codes with the Identifiable Parent Property.
J. Comb. Theory, Ser. A, 1998

The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction].
IEEE Trans. Information Theory, 1997

On Diamond codes.
IEEE Trans. Information Theory, 1997

Protection of software algorithms executed on secure modules.
Future Generation Comp. Syst., 1997

On the realizability of biorthogonal, m-dimensional two-band filter banks.
IEEE Trans. Signal Processing, 1995

Constructions and properties of block codes for partial-response channels.
IEEE Trans. Information Theory, 1995

On constructing regular filter banks from domain bounded polynomials.
IEEE Trans. Signal Processing, 1994

A Note on "A Systematic (12, 8) Code for Correcting Single Errors and Detecting Adjacent Errors".
IEEE Trans. Computers, 1994

A Sharpening of the Johnson Bound for Binary Linear Codes and Nonexistence of Linear Codes with Preparata Parameters.
Des. Codes Cryptography, 1993

On the weight enumerator of product codes.
Discrete Mathematics, 1992

Two new binary codes obtained by shortening a generalized concatenated code.
IEEE Trans. Information Theory, 1991

On the minimum distance of combinatorial codes.
IEEE Trans. Information Theory, 1990

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. Information Theory, 1988

New binary linear block codes.
IEEE Trans. Information Theory, 1987