Jacobus H. van Lint - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2002

An addition to the paper: A polarisation based visual crypto system and its secret sharing schemesHenk D. L. Hollmann, Jacobus H. van Lint, Ludo M. G. M. Tolhuizen, Pim Tuyls. iacr, 2002:195, 2002. [doi]

A polarisation based Visual Crypto System and its Secret Sharing SchemesPim Tuyls, Henk D. L. Hollmann, Jacobus H. van Lint, Ludo M. G. M. Tolhuizen. iacr, 2002:194, 2002. [doi]

1997

Universal SequencesHenk D. L. Hollmann, Jacobus H. van Lint. aaecc, 8(5):347-352, 1997. [doi]

Protection of software algorithms executed on secure modulesHenk D. L. Hollmann, Jean-Paul M. G. Linnartz, Jacobus H. van Lint, Constant P. M. J. Baggen, Ludo M. G. M. Tolhuizen. fgcs, 13(1):55-63, 1997. [doi]

Order Functions and Evaluation CodesTom Høholdt, Jacobus H. van Lint, Ruud Pellikaan. AAECC 1997: 138-150

1996

Protection of Software Algorithms Executed on Secure MicroprocessorsHenk D. L. Hollmann, Jean-Paul M. G. Linnartz, Jacobus H. van Lint, C. P. M. J. Baggen. cardis 1996:

1993

Genetic Algorithms in Coding Theory - A Table for A::3::(::::n, d::::)Rob J. M. Vaessens, Emile H. L. Aarts, Jacobus H. van Lint. DAM, 45(1):71-87, 1993. [doi]

On the minimum distance of ternary cyclic codesMarijn van Eupen, Jacobus H. van Lint. TIT, 39(2):409-422, 1993.

1992

Nonblocking Self-Routing Switching NetworksHenk D. L. Hollmann, Jacobus H. van Lint. DAM, 37/38:319-340, 1992. [doi]

A course in combinatoricsJacobus H. van Lint, Richard M. Wilson. Cambridge University Press, 1992.

1991

More on the minimum distance of cyclic codesP. J. N. de Rooij, Jacobus H. van Lint. TIT, 37(1):187, 1991.

Repeated-root cyclic codesJacobus H. van Lint. TIT, 37(2):343, 1991.

1990

On the minimum distance of combinatorial codesLudo M. G. M. Tolhuizen, Jacobus H. van Lint. TIT, 36(4):922, 1990.

1988

Recent Results on Covering ProblemsJacobus H. van Lint. AAECC 1989: 7-21

Introduction to special section on coding theoryJacobus H. van Lint. TIT, 34(5):1274, 1988.

1987

Generalized Reed - Solomon codes from algebraic geometryJacobus H. van Lint, T. A. Springer. TIT, 33(3):305-309, 1987.

1986

Binary cyclic codes generated by mira7Jacobus H. van Lint, Richard M. Wilson. TIT, 32(2):283, 1986.

On the minimum distance of cyclic codesJacobus H. van Lint, Richard M. Wilson. TIT, 32(1):23-40, 1986.

1984

On equidistant binary codes length n = 4k+1 with distance d = 2kJacobus H. van Lint. combinatorica, 4(4):321-323, 1984.

1983

On the Preparata and Goethals codesR. D. Baker, Jacobus H. van Lint, Richard M. Wilson. TIT, 29(3):342-344, 1983.

1981

Construction of strongly regular graphs, two-weight codes and partial geometries by finite fieldsJacobus H. van Lint, Alexander Schrijver. combinatorica, 1(1):63-73, 1981.

1978

Generalized quadratic residue codesJacobus H. van Lint, F. Jessie MacWilliams. TIT, 24(6):730-737, 1978. [doi]

1972

A new description of the Nadler code (Corresp.)Jacobus H. van Lint. TIT, 18(6):825-826, 1972. [doi]

Block designs with repeated blocksJacobus H. van Lint, H. J. Ryser. DM, 3(4):381-396, 1972. [doi]

1970

On the Nonexistence of Perfect 2- and 3-Hamming-Error-Correcting Codes of GF(q)Jacobus H. van Lint. iandc, 16(4):396-401, June 1970.

Sign in or sign up to see more results.

runs on WebDSL