Ludo M. G. M. Tolhuizen New rate pairs in the zero-error capacity region of the binary multiplying channel without feedback. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1043-1046 [Journal]
Ludo M. G. M. Tolhuizen Two new binary codes obtained by shortening a generalized concatenated code. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1705-0 [Journal]
Ludo M. G. M. Tolhuizen The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction]. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1997, v:43, n:5, pp:1605-1606 [Journal]
Ludo M. G. M. Tolhuizen Correction to 'The Generalized Gilbert-Varshamov Bound is Implied by Turin's Theorem'. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:436- [Journal]
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. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1988, v:34, n:2, pp:333-0 [Journal]
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. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2007, v:53, n:2, pp:823-828 [Journal]