The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ludo M. G. M. Tolhuizen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Peter Sanders, Sebastian Egner, Ludo M. G. M. Tolhuizen
    Polynomial time algorithms for network information flow. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:286-294 [Conf]
  2. 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. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1993, v:3, n:2, pp:95-98 [Journal]
  3. Jack H. van Lint, Ludo M. G. M. Tolhuizen
    On Perfect Ternary Constant Weight Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1999, v:18, n:1/3, pp:231-234 [Journal]
  4. Pim Tuyls, Henk D. L. Hollmann, Jack H. van Lint, Ludo M. G. M. Tolhuizen
    XOR-based Visual Cryptography Schemes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:37, n:1, pp:169-186 [Journal]
  5. 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. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1998, v:82, n:2, pp:121-133 [Journal]
  6. Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen
    Generic erasure correcting sets: Bounds and constructions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:8, pp:1746-1759 [Journal]
  7. 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". [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1994, v:43, n:1, pp:125- [Journal]
  8. C. P. M. J. Baggen, Ludo M. G. M. Tolhuizen
    On Diamond codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:5, pp:1400-1411 [Journal]
  9. Ning Cai, Ludo M. G. M. Tolhuizen, Henk D. L. Hollmann
    Common coordinates in consecutive addresses. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:12, pp:3308-3312 [Journal]
  10. Marten van Dijk, Ludo M. G. M. Tolhuizen
    Efficient encoding for a class of subspace subcodes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:6, pp:2142-2146 [Journal]
  11. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:6, pp:1973-1982 [Journal]
  12. 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]
  13. Ludo M. G. M. Tolhuizen
    More results on the weight enumerator of product codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:9, pp:2573-2577 [Journal]
  14. Ludo M. G. M. Tolhuizen
    New binary linear block codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1987, v:33, n:5, pp:727-0 [Journal]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. Ludo M. G. M. Tolhuizen, Kees A. Schouhamer Immink, Henk D. L. Hollmann
    Constructions and properties of block codes for partial-response channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:6, pp:2019-2026 [Journal]
  20. Ludo M. G. M. Tolhuizen, Jacobus H. van Lint
    On the minimum distance of combinatorial codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:4, pp:922-0 [Journal]
  21. 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]
  22. Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen
    Generating parity check equations for bounded-distance iterative erasure decoding [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  23. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  24. Ludo M. G. M. Tolhuizen, C. P. M. J. Baggen
    On the weight enumerator of product codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:483-488 [Journal]

  25. Quaternary Unequal Error Protection Codes. [Citation Graph (, )][DBLP]


  26. On parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size [Citation Graph (, )][DBLP]


  27. Optimal codes for correcting a single (wrap-around) burst of errors [Citation Graph (, )][DBLP]


Search in 0.026secs, Finished in 0.028secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002