default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJacobus H. van Lint
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
[j36]Pim Tuyls, Henk D. L. Hollmann
, Jack H. van Lint, Ludo M. G. M. Tolhuizen:
XOR-based Visual Cryptography Schemes. Des. Codes Cryptogr. 37(1): 169-186 (2005)- 2002
- [i2]Pim Tuyls, Henk D. L. Hollmann, Jacobus H. van Lint, Ludo M. G. M. Tolhuizen:
A polarisation based Visual Crypto System and its Secret Sharing Schemes. IACR Cryptol. ePrint Arch. 2002: 194 (2002) - [i1]Henk D. L. Hollmann, Jacobus H. van Lint, Ludo M. G. M. Tolhuizen, Pim Tuyls:
An addition to the paper: A polarisation based visual crypto system and its secret sharing schemes. IACR Cryptol. ePrint Arch. 2002: 195 (2002)
1990 – 1999
- 1999
- [j35]Dieter Jungnickel, Jack H. van Lint:
Editorial. Des. Codes Cryptogr. 18(1/3): 5-6 (1999) - [j34]Jack H. van Lint, Ludo M. G. M. Tolhuizen:
On Perfect Ternary Constant Weight Codes. Des. Codes Cryptogr. 18(1/3): 231-234 (1999) - [c4]Tuvi Etzion, Jack H. van Lint:
On perfect constant weight codes. Codes and Association Schemes 1999: 131-134 - 1998
- [j33]Henk D. L. Hollmann, Jack H. van Lint, Jean-Paul M. G. Linnartz, Ludo M. G. M. Tolhuizen:
On Codes with the Identifiable Parent Property. J. Comb. Theory A 82(2): 121-133 (1998) - 1997
- [j32]Henk D. L. Hollmann, Jacobus H. van Lint:
Universal Sequences. Appl. Algebra Eng. Commun. Comput. 8(5): 347-352 (1997) - [j31]Henk D. L. Hollmann, Jean-Paul M. G. Linnartz, Jacobus H. van Lint, Constant P. M. J. Baggen, Ludo M. G. M. Tolhuizen:
Protection of software algorithms executed on secure modules. Future Gener. Comput. Syst. 13(1): 55-63 (1997) - [j30]Jack H. van Lint:
On the Number of Blocks in a Generalized Steiner System. J. Comb. Theory A 80(2): 353-355 (1997) - [c3]Tom Høholdt, Jacobus H. van Lint, Ruud Pellikaan:
Order Functions and Evaluation Codes. AAECC 1997: 138-150 - 1996
- [c2]Henk D. L. Hollmann, Jean-Paul M. G. Linnartz, Jacobus H. van Lint, C. P. M. J. Baggen:
Protection of Software Algorithms Executed on Secure Microprocessors. CARDIS 1996 - 1993
- [j29]Rob J. M. Vaessens, Emile H. L. Aarts, Jacobus H. van Lint:
Genetic Algorithms in Coding Theory - A Table for A3(n, d). Discret. Appl. Math. 45(1): 71-87 (1993) - [j28]Jack H. van Lint, Vladimir D. Tonchev:
A Class of Non-embeddable Designs. J. Comb. Theory A 62(2): 252-260 (1993) - [j27]Marijn van Eupen, Jacobus H. van Lint:
On the minimum distance of ternary cyclic codes. IEEE Trans. Inf. Theory 39(2): 409-422 (1993) - 1992
- [b1]Jacobus H. van Lint, Richard M. Wilson:
A course in combinatorics. Cambridge University Press 1992, ISBN 978-0-521-41057-1, pp. I-XII, 1-530 - [j26]Henk D. L. Hollmann, Jacobus H. van Lint:
Nonblocking Self-Routing Switching Networks. Discret. Appl. Math. 37/38: 319-340 (1992) - 1991
- [j25]P. J. N. de Rooij, Jacobus H. van Lint:
More on the minimum distance of cyclic codes. IEEE Trans. Inf. Theory 37(1): 187-189 (1991) - [j24]Jacobus H. van Lint:
Repeated-root cyclic codes. IEEE Trans. Inf. Theory 37(2): 343-345 (1991) - 1990
- [j23]Ludo M. G. M. Tolhuizen, Jacobus H. van Lint:
On the minimum distance of combinatorial codes. IEEE Trans. Inf. Theory 36(4): 922-923 (1990)
1980 – 1989
- 1989
- [j22]Peter J. M. van Laarhoven, Emile H. L. Aarts, Jack H. van Lint, L. T. Wille:
New upper bounds for the football pool problem for 6, 7, and 8 matches. J. Comb. Theory A 52(2): 304-312 (1989) - 1988
- [j21]Jacobus H. van Lint:
Introduction to special section on coding theory. IEEE Trans. Inf. Theory 34(5): 1274-1275 (1988) - [c1]Jacobus H. van Lint:
Recent Results on Covering Problems. AAECC 1988: 7-21 - 1987
- [j20]Jacobus H. van Lint, T. A. Springer:
Generalized Reed - Solomon codes from algebraic geometry. IEEE Trans. Inf. Theory 33(3): 305-309 (1987) - 1986
- [j19]Jacobus H. van Lint, Richard M. Wilson:
On the minimum distance of cyclic codes. IEEE Trans. Inf. Theory 32(1): 23-40 (1986) - [j18]Jacobus H. van Lint, Richard M. Wilson:
Binary cyclic codes generated by mira7. IEEE Trans. Inf. Theory 32(2): 283- (1986) - 1984
- [j17]Jacobus H. van Lint:
On equidistant binary codes length n = 4k+1 with distance d = 2k. Comb. 4(4): 321-323 (1984) - [j16]Jack H. van Lint, Vladimir D. Tonchev:
Nonembeddable Quasi-residual Designs with Large K. J. Comb. Theory A 37(3): 359-362 (1984) - 1983
- [j15]Ronald D. Baker, Jacobus H. van Lint, Richard M. Wilson:
On the Preparata and Goethals codes. IEEE Trans. Inf. Theory 29(3): 342-344 (1983) - 1982
- [j14]Peter J. Cameron, Jack H. van Lint:
On the Partial Geometry pg(6, 6, 2). J. Comb. Theory A 32(2): 252-255 (1982) - 1981
- [j13]Jacobus H. van Lint, Alexander Schrijver:
Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields. Comb. 1(1): 63-73 (1981) - 1980
- [j12]Aiden A. Bruen, B. L. Rothschild, Jack H. van Lint:
On Characterizing Subspaces. J. Comb. Theory A 29(2): 257-260 (1980)
1970 – 1979
- 1979
- [j11]E. F. Assmus Jr., Jack H. van Lint:
Ovals in Projective Designs. J. Comb. Theory A 27(3): 307-324 (1979) - 1978
- [j10]Clement W. H. Lam, Jack H. van Lint:
Directed graphs with unique paths of fixed length. J. Comb. Theory B 24(3): 331-337 (1978) - [j9]Jacobus H. van Lint, F. Jessie MacWilliams:
Generalized quadratic residue codes. IEEE Trans. Inf. Theory 24(6): 730-737 (1978) - 1977
- [j8]J. I. Hall, A. J. F. M. Jansen, Antoon W. J. Kolen, Jack H. van Lint:
Equidistant codes with distance 12. Discret. Math. 17(1): 71-83 (1977) - [j7]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) - 1974
- [j6]B. L. Rothschild, Jack H. van Lint:
Characterizing Finite Subspaces. J. Comb. Theory A 16(1): 97-110 (1974) - 1973
- [j5]Jack H. van Lint:
A theorem on equidistant codes. Discret. Math. 6(4): 353-358 (1973) - [j4]Jack H. van Lint:
Block Designs with Repeated Blocks and (b, r, lambda) = 1. J. Comb. Theory A 15(3): 288-309 (1973) - 1972
- [j3]Jacobus H. van Lint, H. J. Ryser:
Block designs with repeated blocks. Discret. Math. 3(4): 381-396 (1972) - [j2]Jacobus H. van Lint:
A new description of the Nadler code (Corresp.). IEEE Trans. Inf. Theory 18(6): 825-826 (1972) - 1970
- [j1]Jacobus H. van Lint:
On the Nonexistence of Perfect 2- and 3-Hamming-Error-Correcting Codes of GF(q). Inf. Control. 16(4): 396-401 (1970)
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:26 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:
