 | 2006 |
|---|
| 42 |       | Bram Van Asch,
Aart Blokhuis,
Henk D. L. Hollmann,
William M. Kantor,
Henk C. A. van Tilborg:
Jack van Lint (1932-2004): A survey of his scientific work.
J. Comb. Theory, Ser. A 113(8): 1594-1613 (2006) |
| 2005 |
|---|
| 41 |  | Henk C. A. van Tilborg:
Encyclopedia of Cryptography and Security
Springer 2005 |
| 40 | | Henk C. A. van Tilborg:
Chinese Remainder Theorem.
Encyclopedia of Cryptography and Security 2005 |
| 39 | | Henk C. A. van Tilborg:
Shannon's Model.
Encyclopedia of Cryptography and Security 2005 |
| 2003 |
|---|
| 38 | | Sheng-Bo Xu,
Jeroen Doumen,
Henk C. A. van Tilborg:
On the Security of Digital Signature Schemes Based on Error-Correcting Codes.
Des. Codes Cryptography 28(2): 187-199 (2003) |
| 37 | | Shengli Liu,
Henk C. A. van Tilborg,
Marten van Dijk:
A Practical Protocol for Advantage Distillation and Information Reconciliation.
Des. Codes Cryptography 30(1): 39-62 (2003) |
| 2002 |
|---|
| 36 | | Alexander Kholosha,
Henk C. A. van Tilborg:
Tensor Transform of Boolean Functions and Related Algebraic and Probabilistic Properties.
ICICS 2002: 434-446 |
| 2001 |
|---|
| 35 | | Bram Van Asch,
Henk C. A. van Tilborg:
Two "Dual" Families of Nearly-Linear Codes over Zp, p odd.
Appl. Algebra Eng. Commun. Comput. 11(4): 313-329 (2001) |
| 1999 |
|---|
| 34 | | Sheng-Bo Xu,
Cees Jansen,
Henk C. A. van Tilborg:
A New Authentication Protocol for Portable Communication Systems.
Communications and Multimedia Security 1999: 216-230 |
| 33 | | Alexander Barg,
Evgueni Krouk,
Henk C. A. van Tilborg:
On the complexity of minimum distance decoding of long linear codes.
IEEE Transactions on Information Theory 45(5): 1392-1405 (1999) |
| 1998 |
|---|
| 32 | | Petra Heijnen,
Henk C. A. van Tilborg:
Two observations concerning optimum cyclic burst-correcting codes.
Discrete Mathematics 184(1-3): 111-120 (1998) |
| 31 | | Petra Heijnen,
Henk C. A. van Tilborg,
Tom Verhoeff,
Sander Weijs:
Some New Binary, Quasi-Cyclic Codes.
IEEE Transactions on Information Theory 44(5): 1994-1996 (1998) |
| 1997 |
|---|
| 30 | | Eric R. Verheul,
Henk C. A. van Tilborg:
Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow Proposals.
EUROCRYPT 1997: 119-133 |
| 29 | | Eric R. Verheul,
Henk C. A. van Tilborg:
Cryptanalysis of `Less Short' RSA Secret Exponents.
Appl. Algebra Eng. Commun. Comput. 8(5): 425-435 (1997) |
| 28 | | Eric R. Verheul,
Henk C. A. van Tilborg:
Constructions and Properties of k out of n Visual Secret Sharing Schemes.
Des. Codes Cryptography 11(2): 179-196 (1997) |
| 1995 |
|---|
| 27 | | Henk C. A. van Tilborg:
Authentication Codes: an Area where Coding and Cryptology Meet.
IMA Conf. 1995: 169-183 |
| 26 | | Valeri Korjik,
Michael Ivkov,
Yuri Merinovich,
Alexander Barg,
Henk C. A. van Tilborg:
A Broadcast Key Distribution Scheme Based on Block Designs.
IMA Conf. 1995: 2-12 |
| 25 | | Feng-Wen Sun,
Henk C. A. van Tilborg:
The Leech lattice, the octacode, and decoding algorithms.
IEEE Transactions on Information Theory 41(4): 1097-1106 (1995) |
| 1994 |
|---|
| 24 | | Ofer Amrani,
Yair Be'ery,
Alexander Vardy,
Feng-Wen Sun,
Henk C. A. van Tilborg:
The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions.
IEEE Transactions on Information Theory 40(4): 1030-1043 (1994) |
| 1993 |
|---|
| 23 | | G. Fang,
Henk C. A. van Tilborg,
Feng-Wen Sun,
Iiro S. Honkala:
Some Features of Binary Block Codes for Correcting Asymmetric Errors.
AAECC 1993: 105-120 |
| 22 | | Niels J. C. Lous,
Patrick A. H. Bours,
Henk C. A. van Tilborg:
On maximum likelihood soft-decision decoding of binary linear codes.
IEEE Transactions on Information Theory 39(1): 197- (1993) |
| 21 | | Mario Blaum,
Simon Litsyn,
Vincent Buskens,
Henk C. A. van Tilborg:
Error-correcting codes with bounded running digital sum.
IEEE Transactions on Information Theory 39(1): 216- (1993) |
| 20 | | Feng-Wen Sun,
Henk C. A. van Tilborg:
Approaching capacity by equiprobable signaling on the Gaussian channel.
IEEE Transactions on Information Theory 39(5): 1714- (1993) |
| 1992 |
|---|
| 19 | | G. Fang,
Henk C. A. van Tilborg:
Bounds and Constructions of Asymmetric or Unidirectional Error-Correcting Codes.
Appl. Algebra Eng. Commun. Comput. 3: 269-300 (1992) |
| 18 | | Henk C. A. van Tilborg:
Fire codes revisited.
Discrete Mathematics 106-107: 479-482 (1992) |
| 1990 |
|---|
| 17 | | Patrick A. H. Bours,
Jeannette C. M. Janssen,
Marcel van Asperdt,
Henk C. A. van Tilborg:
Algebraic decoding beyond BCH of some binary cyclic codes, when e>BCH.
IEEE Transactions on Information Theory 36(1): 214- (1990) |
| 16 | | Frank H. Böinck,
Henk C. A. van Tilborg:
Constructions and bounds for systematic t EC/AUED codes.
IEEE Transactions on Information Theory 36(6): 1381-1390 (1990) |
| 1989 |
|---|
| 15 | | Mario Blaum,
Henk C. A. van Tilborg:
On t-Error Correcting/All Unidirectional Error Detecting Codes.
IEEE Trans. Computers 38(11): 1493-1501 (1989) |
| 14 | | Henk C. A. van Tilborg,
Mario Blaum:
On error-correcting balanced codes.
IEEE Transactions on Information Theory 35(5): 1091- (1989) |
| 1988 |
|---|
| 13 | | Henk C. A. van Tilborg:
An overview of recent results in the theory of burst-correcting codes.
Coding Theory and Applications 1988: 164-184 |
| 12 | | Khaled A. S. Abdel-Ghaffar,
Robert J. McEliece,
Henk C. A. van Tilborg:
Two-dimensional burst identification codes and their use in burst correction.
IEEE Transactions on Information Theory 34(3): 494-504 (1988) |
| 11 | | Mario Blaum,
Patrick G. Farrell,
Henk C. A. van Tilborg:
Multiple burst-correcting array codes.
IEEE Transactions on Information Theory 34(5): 1061- (1988) |
| 1986 |
|---|
| 10 | | Henk C. A. van Tilborg:
An upper bound for codes for the noisy two-access binary adder channel.
IEEE Transactions on Information Theory 32(3): 436- (1986) |
| 9 | | Khaled A. S. Abdel-Ghaffar,
Robert J. McEliece,
Andrew M. Odlyzko,
Henk C. A. van Tilborg:
On the existence of optimum cyclic burst-correcting codes.
IEEE Transactions on Information Theory 32(6): 768-775 (1986) |
| 8 | | Mario Blaum,
Henk C. A. van Tilborg,
Patrick G. Farrell:
A class of burst error-correcting array codes.
IEEE Transactions on Information Theory 32(6): 836- (1986) |
| 1985 |
|---|
| 7 | | P. A. B. M. Coebergh van den Braak,
Henk C. A. van Tilborg:
A family of good uniquely decodable code pairs for the two-access binary adder channel.
IEEE Transactions on Information Theory 31(1): 3-9 (1985) |
| 6 | | Peter B. Busschbach,
Michiel G. L. Gerretzen,
Henk C. A. van Tilborg:
On the covering radius of binary, linear codes meeting the Griesmer bound.
IEEE Transactions on Information Theory 31(4): 465-468 (1985) |
| 1983 |
|---|
| 5 | | Henk C. A. van Tilborg:
Upper bounds on |C2| for a uniquely decodable code pair (C1, C2) for a two-access binary adder channel.
IEEE Transactions on Information Theory 29(3): 386-389 (1983) |
| 1981 |
|---|
| 4 | | Henk C. A. van Tilborg:
The smallest length of binary 7-dimensional linear codes with prescribed minimum distance.
Discrete Mathematics 33(2): 197-207 (1981) |
| 3 | | Tor Helleseth,
Henk C. A. van Tilborg:
A new class of codes meeting the Griesmer bound.
IEEE Transactions on Information Theory 27(5): 548-555 (1981) |
| 1980 |
|---|
| 2 | | Henk C. A. van Tilborg:
On the Uniqueness Resp. Nonexistence of Certain codes Meeting the Griesmer Bound
Information and Control 44(1): 16-35 (1980) |
| 1977 |
|---|
| 1 | | Jack H. van Lint,
Henk C. A. van Tilborg,
J. R. Wiekema:
Block Designs with v = 10, k = 5, lambda = 4.
J. Comb. Theory, Ser. A 23(1): 105-115 (1977) |
