Henk C. A. van Tilborg - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 44 from 44

2006

Jack van Lint (1932-2004): A survey of his scientific workBram Van Asch, Aart Blokhuis, Henk D. L. Hollmann, William M. Kantor, Henk C. A. van Tilborg. JCT, 113(8):1594-1613, 2006. [doi]

2003

A Practical Protocol for Advantage Distillation and Information ReconciliationShengli Liu, Henk C. A. van Tilborg, Marten van Dijk. dcc, 30(1):39-62, 2003. [doi]

On the Security of Digital Signature Schemes Based on Error-Correcting CodesSheng-Bo Xu, Jeroen Doumen, Henk C. A. van Tilborg. dcc, 28(2):187-199, 2003.

2002

Tensor Transform of Boolean Functions and Related Algebraic and Probabilistic PropertiesAlexander Kholosha, Henk C. A. van Tilborg. icics 2002: 434-446 [doi]

Tensor Transform of Boolean Functions and Related Algebraic and Probabilistic PropertiesAlexander Kholosha, Henk C. A. van Tilborg. iacr, 2002:49, 2002. [doi]

2001

Two Dual Families of Nearly-Linear Codes over Z::p::, p oddBram Van Asch, Henk C. A. van Tilborg. aaecc, 11(4):313-329, 2001. [doi]

1999

On the complexity of minimum distance decoding of long linear codesAlexander Barg, Evgueni Krouk, Henk C. A. van Tilborg. TIT, 45(5):1392-1405, 1999.

A New Authentication Protocol for Portable Communication SystemsSheng-Bo Xu, Cees Jansen, Henk C. A. van Tilborg. cmsb 1999: 216-230

1998

Two observations concerning optimum cyclic burst-correcting codesPetra Heijnen, Henk C. A. van Tilborg. DM, 184(1-3):111-120, 1998. [doi]

Some New Binary, Quasi-Cyclic CodesPetra Heijnen, Henk C. A. van Tilborg, Tom Verhoeff, Sander Weijs. TIT, 44(5):1994-1996, 1998.

1997

Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow ProposalsEric R. Verheul, Henk C. A. van Tilborg. eurocrypt 1997: 119-133 [doi]

Cryptanalysis of Less Short RSA Secret ExponentsEric R. Verheul, Henk C. A. van Tilborg. aaecc, 8(5):425-435, 1997. [doi]

Constructions and Properties of k out of n Visual Secret Sharing SchemesEric R. Verheul, Henk C. A. van Tilborg. dcc, 11(2):179-196, 1997.

1995

A Broadcast Key Distribution Scheme Based on Block DesignsValeri Korjik, Michael Ivkov, Yuri Merinovich, Alexander Barg, Henk C. A. van Tilborg. ima 1995: 2-12

The Leech lattice, the octacode, and decoding algorithmsFeng-Wen Sun, Henk C. A. van Tilborg. TIT, 41(4):1097-1106, 1995.

Authentication Codes: an Area where Coding and Cryptology MeetHenk C. A. van Tilborg. ima 1995: 169-183

1994

The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructionsOfer Amrani, Yair Be ery, Alexander Vardy, Feng-Wen Sun, Henk C. A. van Tilborg. TIT, 40(4):1030-1043, 1994.

1993

1992

Bounds and Constructions of Asymmetric or Unidirectional Error-Correcting CodesG. Fang, Henk C. A. van Tilborg. aaecc, 3:269-300, 1992.

Fire codes revisitedHenk C. A. van Tilborg. DM, 106-107:479-482, 1992. [doi]

1990

Algebraic decoding beyond BCH of some binary cyclic codes, when e>BCHPatrick A. H. Bours, Jeannette C. M. Janssen, Marcel van Asperdt, Henk C. A. van Tilborg. TIT, 36(1):214, 1990.

Constructions and bounds for systematic t EC/AUED codesFrank H. Böinck, Henk C. A. van Tilborg. TIT, 36(6):1381-1390, 1990.

1989

On t-Error Correcting/All Unidirectional Error Detecting CodesMario Blaum, Henk C. A. van Tilborg. TC, 38(11):1493-1501, 1989.

On error-correcting balanced codesHenk C. A. van Tilborg, Mario Blaum. TIT, 35(5):1091, 1989.

1988

Two-dimensional burst identification codes and their use in burst correctionKhaled A. S. Abdel-Ghaffar, Robert J. McEliece, Henk C. A. van Tilborg. TIT, 34(3):494-504, 1988.

Multiple burst-correcting array codesMario Blaum, Patrick G. Farrell, Henk C. A. van Tilborg. TIT, 34(5):1061, 1988.

An overview of recent results in the theory of burst-correcting codesHenk C. A. van Tilborg. coding 1989: 164-184

1986

On the existence of optimum cyclic burst-correcting codesKhaled A. S. Abdel-Ghaffar, Robert J. McEliece, Andrew M. Odlyzko, Henk C. A. van Tilborg. TIT, 32(6):768-775, 1986.

A class of burst error-correcting array codesMario Blaum, Henk C. A. van Tilborg, Patrick G. Farrell. TIT, 32(6):836, 1986.

An upper bound for codes for the noisy two-access binary adder channelHenk C. A. van Tilborg. TIT, 32(3):436, 1986.

1985

On the covering radius of binary, linear codes meeting the Griesmer boundPeter B. Busschbach, Michiel G. L. Gerretzen, Henk C. A. van Tilborg. TIT, 31(4):465-468, 1985.

A family of good uniquely decodable code pairs for the two-access binary adder channelP. A. B. M. Coebergh van den Braak, Henk C. A. van Tilborg. TIT, 31(1):3-9, 1985.

1983

Upper bounds on |C::2::| for a uniquely decodable code pair (C::1::, C::2::) for a two-access binary adder channelHenk C. A. van Tilborg. TIT, 29(3):386-389, 1983.

1981

A new class of codes meeting the Griesmer boundTor Helleseth, Henk C. A. van Tilborg. TIT, 27(5):548-555, 1981.

The smallest length of binary 7-dimensional linear codes with prescribed minimum distanceHenk C. A. van Tilborg. DM, 33(2):197-207, 1981. [doi]

1980

On the Uniqueness Resp. Nonexistence of Certain codes Meeting the Griesmer BoundHenk C. A. van Tilborg. iandc, 44(1):16-35, January 1980.

1979

Symbol synchronization in convolutionally coded systems (Corresp.)Leonard D. Baumert, Robert J. McEliece, Henk C. A. van Tilborg. TIT, 25(3):362-365, 1979. [doi]

1978

On the inherent intractability of certain coding problems (Corresp.)Elwyn R. Berlekamp, Robert J. McEliece, Henk C. A. van Tilborg. TIT, 24(3):384-386, 1978. [doi]

On quasi-cyclic codes with rate l m (Corresp.)Henk C. A. van Tilborg. TIT, 24(5):628-630, 1978. [doi]

An upper bound for codes in a two-access binary erasure channel (Corresp.)Henk C. A. van Tilborg. TIT, 24(1):112-116, 1978. [doi]

1977

Block Designs with v = 10, k = 5, lambda = 4Jack H. van Lint, Henk C. A. van Tilborg, J. R. Wiekema. JCT, 23(1):105-115, 1977.

Sign in or sign up to see more results.

runs on WebDSL