default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHenk C. A. van Tilborg
Person information
- affiliation: Eindhoven University of Technology, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[e2]Henk C. A. van Tilborg, Sushil Jajodia:
Encyclopedia of Cryptography and Security, 2nd Ed. Springer 2011, ISBN 978-1-4419-5905-8 [contents]- [r4]Henk C. A. van Tilborg:
Chinese Remainder Theorem. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 201-202 - [r3]Henk C. A. van Tilborg:
Shannon's Model. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1194-1195
2000 – 2009
- 2009
- [j41]Yvo Desmedt, Niels Duif, Henk van Tilborg, Huaxiong Wang:
Bounds and constructions for key distribution schemes. Adv. Math. Commun. 3(3): 273-293 (2009) - [p1]Henk van Tilborg:
Authentication Codes from Error-Correcting Codes; An Overview. Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes 2009: 3-16 - 2007
- [j40]Henk van Tilborg, Josef Pieprzyk, Ron Steinfeld, Huaxiong Wang:
New constructions of anonymous membership broadcasting schemes. Adv. Math. Commun. 1(1): 29-44 (2007) - 2006
- [j39]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 A 113(8): 1594-1613 (2006) - 2005
- [e1]Henk C. A. van Tilborg:
Encyclopedia of Cryptography and Security. Springer 2005, ISBN 978-0-387-23473-1 [contents] - [r2]Henk C. A. van Tilborg:
Chinese Remainder Theorem. Encyclopedia of Cryptography and Security 2005 - [r1]Henk C. A. van Tilborg:
Shannon's Model. Encyclopedia of Cryptography and Security 2005 - 2003
- [j38]Sheng-Bo Xu, Jeroen Doumen, Henk C. A. van Tilborg:
On the Security of Digital Signature Schemes Based on Error-Correcting Codes. Des. Codes Cryptogr. 28(2): 187-199 (2003) - [j37]Shengli Liu, Henk C. A. van Tilborg, Marten van Dijk:
A Practical Protocol for Advantage Distillation and Information Reconciliation. Des. Codes Cryptogr. 30(1): 39-62 (2003) - 2002
- [c7]Alexander Kholosha, Henk C. A. van Tilborg:
Tensor Transform of Boolean Functions and Related Algebraic and Probabilistic Properties. ICICS 2002: 434-446 - [i1]Alexander Kholosha, Henk C. A. van Tilborg:
Tensor Transform of Boolean Functions and Related Algebraic and Probabilistic Properties. IACR Cryptol. ePrint Arch. 2002: 49 (2002) - 2001
- [j36]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)
1990 – 1999
- 1999
- [j35]Alexander Barg, E. A. Krouk, Henk C. A. van Tilborg:
On the complexity of minimum distance decoding of long linear codes. IEEE Trans. Inf. Theory 45(5): 1392-1405 (1999) - [c6]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 - 1998
- [j34]Petra Heijnen, Henk C. A. van Tilborg:
Two observations concerning optimum cyclic burst-correcting codes. Discret. Math. 184(1-3): 111-120 (1998) - [j33]Petra Heijnen, Henk C. A. van Tilborg, Tom Verhoeff, Sander Weijs:
Some New Binary, Quasi-Cyclic Codes. IEEE Trans. Inf. Theory 44(5): 1994-1996 (1998) - 1997
- [j32]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) - [j31]Eric R. Verheul, Bert-Jaap Koops, Henk van Tilborg:
Binding cryptography - A fraud-detectible alternative to Key-Escrow proposals. Comput. Law Secur. Rev. 13(1): 3-14 (1997) - [j30]Eric R. Verheul, Henk C. A. van Tilborg:
Constructions and Properties of k out of n Visual Secret Sharing Schemes. Des. Codes Cryptogr. 11(2): 179-196 (1997) - [c5]Eric R. Verheul, Henk C. A. van Tilborg:
Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow Proposals. EUROCRYPT 1997: 119-133 - 1995
- [j29]Feng-Wen Sun, Henk C. A. van Tilborg:
The Leech lattice, the octacode, and decoding algorithms. IEEE Trans. Inf. Theory 41(4): 1097-1106 (1995) - [c4]Valeri Korjik, Michael Ivkov, Yuri Merinovich, Alexander Barg, Henk C. A. van Tilborg:
A Broadcast Key Distribution Scheme Based on Block Designs. IMACC 1995: 2-12 - [c3]Henk C. A. van Tilborg:
Authentication Codes: an Area where Coding and Cryptology Meet. IMACC 1995: 169-183 - 1994
- [j28]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 Trans. Inf. Theory 40(4): 1030-1043 (1994) - 1993
- [j27]Niels J. C. Lous, Patrick A. H. Bours, Henk C. A. van Tilborg:
On maximum likelihood soft-decision decoding of binary linear codes. IEEE Trans. Inf. Theory 39(1): 197-203 (1993) - [j26]Mario Blaum, Simon Litsyn, Vincent Buskens, Henk C. A. van Tilborg:
Error-correcting codes with bounded running digital sum. IEEE Trans. Inf. Theory 39(1): 216-227 (1993) - [j25]Feng-Wen Sun, Henk C. A. van Tilborg:
Approaching capacity by equiprobable signaling on the Gaussian channel. IEEE Trans. Inf. Theory 39(5): 1714-1716 (1993) - [c2]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 - 1992
- [j24]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) - [j23]Henk C. A. van Tilborg:
Fire codes revisited. Discret. Math. 106-107: 479-482 (1992) - 1990
- [j22]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 Trans. Inf. Theory 36(1): 214-222 (1990) - [j21]Frank H. Böinck, Henk C. A. van Tilborg:
Constructions and bounds for systematic t EC/AUED codes. IEEE Trans. Inf. Theory 36(6): 1381-1390 (1990)
1980 – 1989
- 1989
- [j20]Mario Blaum, Henk C. A. van Tilborg:
On t-Error Correcting/All Unidirectional Error Detecting Codes. IEEE Trans. Computers 38(11): 1493-1501 (1989) - [j19]Henk C. A. van Tilborg, Mario Blaum:
On error-correcting balanced codes. IEEE Trans. Inf. Theory 35(5): 1091-1095 (1989) - 1988
- [j18]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 Trans. Inf. Theory 34(3): 494-504 (1988) - [j17]Mario Blaum, Patrick Guy Farrell, Henk C. A. van Tilborg:
Multiple burst-correcting array codes. IEEE Trans. Inf. Theory 34(5): 1061-1066 (1988) - [c1]Henk C. A. van Tilborg:
An overview of recent results in the theory of burst-correcting codes. Coding Theory and Applications 1988: 164-184 - 1986
- [j16]Henk C. A. van Tilborg:
An upper bound for codes for the noisy two-access binary adder channel. IEEE Trans. Inf. Theory 32(3): 436-440 (1986) - [j15]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 Trans. Inf. Theory 32(6): 768-775 (1986) - [j14]Mario Blaum, Henk C. A. van Tilborg, Patrick Guy Farrell:
A class of burst error-correcting array codes. IEEE Trans. Inf. Theory 32(6): 836-839 (1986) - 1985
- [j13]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 Trans. Inf. Theory 31(1): 3-9 (1985) - [j12]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 Trans. Inf. Theory 31(4): 465-468 (1985) - 1983
- [j11]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 Trans. Inf. Theory 29(3): 386-389 (1983) - 1981
- [j10]Henk C. A. van Tilborg:
The smallest length of binary 7-dimensional linear codes with prescribed minimum distance. Discret. Math. 33(2): 197-207 (1981) - [j9]Tor Helleseth, Henk C. A. van Tilborg:
A new class of codes meeting the Griesmer bound. IEEE Trans. Inf. Theory 27(5): 548-555 (1981) - 1980
- [j8]Henk C. A. van Tilborg:
On the Uniqueness Resp. Nonexistence of Certain codes Meeting the Griesmer Bound. Inf. Control. 44(1): 16-35 (1980)
1970 – 1979
- 1979
- [j7]Leonard D. Baumert, Robert J. McEliece, Henk C. A. van Tilborg:
Symbol synchronization in convolutionally coded systems (Corresp.). IEEE Trans. Inf. Theory 25(3): 362-365 (1979) - 1978
- [j6]Henk van Tilborg:
On the existence of a cyclic code with rate R. Discret. Math. 22(1): 97-98 (1978) - [j5]Henk C. A. van Tilborg:
An upper bound for codes in a two-access binary erasure channel (Corresp.). IEEE Trans. Inf. Theory 24(1): 112-116 (1978) - [j4]Elwyn R. Berlekamp, Robert J. McEliece, Henk C. A. van Tilborg:
On the inherent intractability of certain coding problems (Corresp.). IEEE Trans. Inf. Theory 24(3): 384-386 (1978) - [j3]Henk C. A. van Tilborg:
On quasi-cyclic codes with rate l m (Corresp.). IEEE Trans. Inf. Theory 24(5): 628-630 (1978) - 1977
- [j2]Jack H. van Lint, Henk C. A. van Tilborg, J. R. Wiekema:
Block Designs with v = 10, k = 5, lambda = 4. J. Comb. Theory A 23(1): 105-115 (1977) - 1976
- [j1]Henk van Tilborg:
A lower bound for v in a t - (v, k, λ) design. Discret. Math. 14(4): 399-402 (1976)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
