Jacobus H. van Lint

According to our database1, Jacobus H. van Lint authored at least 43 papers between 1970 and 2005.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2005
XOR-based Visual Cryptography Schemes.
Des. Codes Cryptography, 2005

2002
A polarisation based Visual Crypto System and its Secret Sharing Schemes.
IACR Cryptology ePrint Archive, 2002

An addition to the paper: A polarisation based visual crypto system and its secret sharing schemes.
IACR Cryptology ePrint Archive, 2002

1999
On Perfect Ternary Constant Weight Codes.
Des. Codes Cryptography, 1999

Editorial.
Des. Codes Cryptography, 1999

On perfect constant weight codes.
Proceedings of the Codes and Association Schemes, 1999

1998
On Codes with the Identifiable Parent Property.
J. Comb. Theory, Ser. A, 1998

1997
On the Number of Blocks in a Generalized Steiner System.
J. Comb. Theory, Ser. A, 1997

Protection of software algorithms executed on secure modules.
Future Generation Comp. Syst., 1997

Universal Sequences.
Appl. Algebra Eng. Commun. Comput., 1997

Order Functions and Evaluation Codes.
Proceedings of the Applied Algebra, 1997

1996
Protection of Software Algorithms Executed on Secure Microprocessors.
Proceedings of the Second Smart Card Research and Advanced Application Conference, 1996

1993
On the minimum distance of ternary cyclic codes.
IEEE Trans. Information Theory, 1993

A Class of Non-embeddable Designs.
J. Comb. Theory, Ser. A, 1993

Genetic Algorithms in Coding Theory - A Table for A3(n, d).
Discrete Applied Mathematics, 1993

1992
Nonblocking Self-Routing Switching Networks.
Discrete Applied Mathematics, 1992

A course in combinatorics.
Cambridge University Press, ISBN: 978-0-521-41057-1, 1992

1991
More on the minimum distance of cyclic codes.
IEEE Trans. Information Theory, 1991

Repeated-root cyclic codes.
IEEE Trans. Information Theory, 1991

1990
On the minimum distance of combinatorial codes.
IEEE Trans. Information Theory, 1990

1989
New upper bounds for the football pool problem for 6, 7, and 8 matches.
J. Comb. Theory, Ser. A, 1989

1988
Introduction to special section on coding theory.
IEEE Trans. Information Theory, 1988

Recent Results on Covering Problems.
Proceedings of the Applied Algebra, 1988

1987
Generalized Reed - Solomon codes from algebraic geometry.
IEEE Trans. Information Theory, 1987

1986
Binary cyclic codes generated by mira7.
IEEE Trans. Information Theory, 1986

On the minimum distance of cyclic codes.
IEEE Trans. Information Theory, 1986

1984
Nonembeddable Quasi-residual Designs with Large K.
J. Comb. Theory, Ser. A, 1984

On equidistant binary codes length n = 4k+1 with distance d = 2k.
Combinatorica, 1984

1983
On the Preparata and Goethals codes.
IEEE Trans. Information Theory, 1983

1982
On the Partial Geometry pg(6, 6, 2).
J. Comb. Theory, Ser. A, 1982

1981
Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields.
Combinatorica, 1981

1980
On Characterizing Subspaces.
J. Comb. Theory, Ser. A, 1980

1979
Ovals in Projective Designs.
J. Comb. Theory, Ser. A, 1979

1978
Generalized quadratic residue codes.
IEEE Trans. Information Theory, 1978

Directed graphs with unique paths of fixed length.
J. Comb. Theory, Ser. B, 1978

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

Equidistant codes with distance 12.
Discrete Mathematics, 1977

1974
Characterizing Finite Subspaces.
J. Comb. Theory, Ser. A, 1974

1973
Block Designs with Repeated Blocks and (b, r, lambda) = 1.
J. Comb. Theory, Ser. A, 1973

A theorem on equidistant codes.
Discrete Mathematics, 1973

1972
A new description of the Nadler code (Corresp.).
IEEE Trans. Information Theory, 1972

Block designs with repeated blocks.
Discrete Mathematics, 1972

1970
On the Nonexistence of Perfect 2- and 3-Hamming-Error-Correcting Codes of GF(q)
Information and Control, June, 1970


  Loading...