#### Filter Results:

- Full text PDF available (14)

#### Publication Year

1980

2018

- This year (1)
- Last 5 years (2)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Sidharth Jaggi, Peter Sanders, +4 authors Ludo M. G. M. Tolhuizen
- IEEE Transactions on Information Theory
- 2005

The famous max-flow min-cut theorem states that a source node s can send information through a network (V, E) to a sink node t at a rate determined by the min-cut separating s and t. Recently, it hasâ€¦ (More)

The famous max-flow min-cut theorem states that a source node s can send information through a network (V,E) to a sink node t at a data rate determined by the min-cut separating s and t. Recently itâ€¦ (More)

- Pim Tuyls, Henk D. L. Hollmann, Jacobus H. van Lint, Ludo M. G. M. Tolhuizen
- Des. Codes Cryptography
- 2005

A recent publication introduced a Visual Crypto (VC) system, based on the polarisation of light. This VC system has good resolution, contrast and colour properties. Mathematically, the VC system isâ€¦ (More)

- Henk D. L. Hollmann, Jacobus H. van Lint, Jean-Paul M. G. Linnartz, Ludo M. G. M. Tolhuizen
- J. Comb. Theory, Ser. A
- 1998

If C is a q-ary code of length n and a and b are two codewords, then c is called a descendant of a and b if ci 2 fai; big for i = 1; : : : ; n. We are interested in codes C with the property that,â€¦ (More)

- Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen
- IEEE Transactions on Information Theory
- 2007

Recently there has been interest in the construction of small parity-check sets for iterative decoding of the Hamming code with the property that each uncorrectable (or stopping) set of size three isâ€¦ (More)

We consider codes over the alphabet Q = {0, 1,. .. , q âˆ’ 1} intended for the control of unidirectional errors of level â„“. That is, the transmission channel is such that the received word cannotâ€¦ (More)

- Ludo M. G. M. Tolhuizen
- IEEE Trans. Information Theory
- 2002

- Ludo M. G. M. Tolhuizen
- IEEE Trans. Information Theory
- 2000

We construct uniquely decodable (UD) code pairs for the binary multiplying channel without feedback, using pairs of binary codes. By taking appropriate cosets of linear codes with many informationâ€¦ (More)

- Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen
- J. Comb. Theory, Ser. A
- 2006

A generic (r,m)-erasure correcting set generates for each binary linear code of codimension r a collection of parity check equations that enables iterative decoding of all potentially correctableâ€¦ (More)

- Ludo M. G. M. Tolhuizen
- IEEE Trans. Information Theory
- 1997

The generalization of the Gilbertâ€“Varshamov bound due to Gu and Fuja is a direct consequence of TuÅ• anâ€™s theorem on the existence of a clique in a graph with many edges. Tur Ã¡nâ€™s theorem allows aâ€¦ (More)