Search the dblp DataBase
Jacobus H. van Lint: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Tom Høholdt, Jacobus H. van Lint, Ruud Pellikaan
Order Functions and Evaluation Codes. [Citation Graph (0, 0)][DBLP]
AAECC, 1997, pp:138-150 [Conf] - Jacobus H. van Lint
Recent Results on Covering Problems. [Citation Graph (0, 0)][DBLP]
AAECC, 1988, pp:7-21 [Conf] - 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. [Citation Graph (0, 0)][DBLP]
CARDIS, 1996, pp:- [Conf] - Henk D. L. Hollmann, Jacobus H. van Lint
Universal Sequences. [Citation Graph (0, 0)][DBLP]
Appl. Algebra Eng. Commun. Comput., 1997, v:8, n:5, pp:347-352 [Journal] - Jacobus H. van Lint
On equidistant binary codes length n = 4k+1 with distance d = 2k. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1984, v:4, n:4, pp:321-323 [Journal] - Jacobus H. van Lint, Alexander Schrijver
Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1981, v:1, n:1, pp:63-73 [Journal] - Henk D. L. Hollmann, Jacobus H. van Lint
Nonblocking Self-Routing Switching Networks. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1992, v:37, n:, pp:319-340 [Journal] - Rob J. M. Vaessens, Emile H. L. Aarts, Jacobus H. van Lint
Genetic Algorithms in Coding Theory - A Table for A3(n, d). [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1993, v:45, n:1, pp:71-87 [Journal] - Jacobus H. van Lint
On the Nonexistence of Perfect 2- and 3-Hamming-Error-Correcting Codes of GF(q) [Citation Graph (0, 0)][DBLP]
Information and Control, 1970, v:16, n:4, pp:396-401 [Journal] - R. D. Baker, Jacobus H. van Lint, Richard M. Wilson
On the Preparata and Goethals codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:342-344 [Journal] - Marijn van Eupen, Jacobus H. van Lint
On the minimum distance of ternary cyclic codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:409-422 [Journal] - Jacobus H. van Lint
Introduction to special section on coding theory. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1274-0 [Journal] - Jacobus H. van Lint
Repeated-root cyclic codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:343-0 [Journal] - Jacobus H. van Lint, T. A. Springer
Generalized Reed - Solomon codes from algebraic geometry. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1987, v:33, n:3, pp:305-309 [Journal] - Jacobus H. van Lint, Richard M. Wilson
On the minimum distance of cyclic codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1986, v:32, n:1, pp:23-40 [Journal] - Jacobus H. van Lint, Richard M. Wilson
Binary cyclic codes generated by mira7. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1986, v:32, n:2, pp:283-0 [Journal] - P. J. N. de Rooij, Jacobus H. van Lint
More on the minimum distance of cyclic codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1991, v:37, n:1, pp:187-0 [Journal] - Ludo M. G. M. Tolhuizen, Jacobus H. van Lint
On the minimum distance of combinatorial codes. [Citation Graph (0, 0)][DBLP]
IEEE Transactions on Information Theory, 1990, v:36, n:4, pp:922-0 [Journal]
Search in 0.002secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002