Henk C. A. van Tilborg

According to our database1, Henk C. A. van Tilborg authored at least 51 papers between 1976 and 2011.

Collaborative distances:

Awards

IEEE Fellow

IEEE Fellow 2000, "For contributions to coding theory and cryptography.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2011
Chinese Remainder Theorem.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

2009
Authentication Codes from Error-Correcting Codes; An Overview.
Proceedings of the Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes, 2009

Bounds and constructions for key distribution schemes.
Adv. in Math. of Comm., 2009

2007
New constructions of anonymous membership broadcasting schemes.
Adv. in Math. of Comm., 2007

2006
Jack van Lint (1932-2004): A survey of his scientific work.
J. Comb. Theory, Ser. A, 2006

2005
Shannon's Model.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

2003
On the Security of Digital Signature Schemes Based on Error-Correcting Codes.
Des. Codes Cryptogr., 2003

A Practical Protocol for Advantage Distillation and Information Reconciliation.
Des. Codes Cryptogr., 2003

2002
Tensor Transform of Boolean Functions and Related Algebraic and Probabilistic Properties.
IACR Cryptology ePrint Archive, 2002

Tensor Transform of Boolean Functions and Related Algebraic and Probabilistic Properties.
Proceedings of the Information and Communications Security, 4th International Conference, 2002

2001
Two "Dual" Families of Nearly-Linear Codes over Zp, p odd.
Appl. Algebra Eng. Commun. Comput., 2001

1999
On the complexity of minimum distance decoding of long linear codes.
IEEE Trans. Information Theory, 1999

A New Authentication Protocol for Portable Communication Systems.
Proceedings of the Secure Information Networks: Communications and Multimedia Security, 1999

1998
Some New Binary, Quasi-Cyclic Codes.
IEEE Trans. Information Theory, 1998

Two observations concerning optimum cyclic burst-correcting codes.
Discrete Mathematics, 1998

1997
Constructions and Properties of k out of n Visual Secret Sharing Schemes.
Des. Codes Cryptogr., 1997

Cryptanalysis of 'Less Short' RSA Secret Exponents.
Appl. Algebra Eng. Commun. Comput., 1997

Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow Proposals.
Proceedings of the Advances in Cryptology, 1997

1995
The Leech lattice, the octacode, and decoding algorithms.
IEEE Trans. Information Theory, 1995

Authentication Codes: an Area where Coding and Cryptology Meet.
Proceedings of the Cryptography and Coding, 1995

A Broadcast Key Distribution Scheme Based on Block Designs.
Proceedings of the Cryptography and Coding, 1995

1994
The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions.
IEEE Trans. Information Theory, 1994

1993
Approaching capacity by equiprobable signaling on the Gaussian channel.
IEEE Trans. Information Theory, 1993

On maximum likelihood soft-decision decoding of binary linear codes.
IEEE Trans. Information Theory, 1993

Error-correcting codes with bounded running digital sum.
IEEE Trans. Information Theory, 1993

Some Features of Binary Block Codes for Correcting Asymmetric Errors.
Proceedings of the Applied Algebra, 1993

1992
Fire codes revisited.
Discrete Mathematics, 1992

Bounds and Constructions of Asymmetric or Unidirectional Error-Correcting Codes.
Appl. Algebra Eng. Commun. Comput., 1992

1990
Algebraic decoding beyond BCH of some binary cyclic codes, when e>BCH.
IEEE Trans. Information Theory, 1990

Constructions and bounds for systematic t EC/AUED codes.
IEEE Trans. Information Theory, 1990

1989
On error-correcting balanced codes.
IEEE Trans. Information Theory, 1989

On t-Error Correcting/All Unidirectional Error Detecting Codes.
IEEE Trans. Computers, 1989

1988
Multiple burst-correcting array codes.
IEEE Trans. Information Theory, 1988

Two-dimensional burst identification codes and their use in burst correction.
IEEE Trans. Information Theory, 1988

An overview of recent results in the theory of burst-correcting codes.
Proceedings of the Coding Theory and Applications, 1988

1986
An upper bound for codes for the noisy two-access binary adder channel.
IEEE Trans. Information Theory, 1986

A class of burst error-correcting array codes.
IEEE Trans. Information Theory, 1986

On the existence of optimum cyclic burst-correcting codes.
IEEE Trans. Information Theory, 1986

1985
On the covering radius of binary, linear codes meeting the Griesmer bound.
IEEE Trans. Information Theory, 1985

A family of good uniquely decodable code pairs for the two-access binary adder channel.
IEEE Trans. Information Theory, 1985

1983
Upper bounds on |C2| for a uniquely decodable code pair (C1, C2) for a two-access binary adder channel.
IEEE Trans. Information Theory, 1983

1981
A new class of codes meeting the Griesmer bound.
IEEE Trans. Information Theory, 1981

The smallest length of binary 7-dimensional linear codes with prescribed minimum distance.
Discrete Mathematics, 1981

1980
On the Uniqueness Resp. Nonexistence of Certain codes Meeting the Griesmer Bound
Information and Control, January, 1980

1979
Symbol synchronization in convolutionally coded systems (Corresp.).
IEEE Trans. Information Theory, 1979

1978
On quasi-cyclic codes with rate l m (Corresp.).
IEEE Trans. Information Theory, 1978

An upper bound for codes in a two-access binary erasure channel (Corresp.).
IEEE Trans. Information Theory, 1978

On the inherent intractability of certain coding problems (Corresp.).
IEEE Trans. Information Theory, 1978

On the existence of a cyclic code with rate R.
Discrete Mathematics, 1978

1977
Block Designs with v = 10, k = 5, lambda = 4.
J. Comb. Theory, Ser. A, 1977

1976
A lower bound for v in a t - (v, k, λ) design.
Discrete Mathematics, 1976


  Loading...