Ludo Tolhuizen - Concepedia

Author

Ludo Tolhuizen

Also Known As

L. M. G. M. Tolhuizen, L. Tolhuizen, L.M. Tolhuizen, L.M.G. Tolhuizen, L.M.G.M. Tolhuizen, Ludo M. G. M. Tolhuizen, Ludo M. G. Tolhuizen, Ludo M.G.M Tolhuizen, Ludo M.G.M. Tolhuizen, Ludo Tolhuizen

Publications

2.4K

Citations

H-Index

Concepts

All Affiliations

Philips (Netherlands)Philips (Finland)NXP (Netherlands)Eindhoven University of Technology

About

Ludo Tolhuizen is an author at Philips (Netherlands) specializing in engineering, computer science, and computational complexity.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	18	23	2.1K
2	Computer Science	15	19	1.8K
3	Computer Engineering	6	6	1.1K
4	Business	1	1	956
5	Education	1	1	35

Ludo Tolhuizen

Publications

2.1K

Citations

H-Index

Page 1

	Year	Citations
Polynomial Time Algorithms for Multicast Network Code Construction Sidharth Jaggi, Peter Sanders, Philip A. Chou, IEEE Transactions on Information Theory EngineeringNetwork AnalysisComputational ComplexityCommunication ComplexitySink Node T	2005	956
Polynomial time algorithms for network information flow Peter Sanders, Sebastian Egner, Ludo Tolhuizen EngineeringNetwork AnalysisComputational ComplexitySink Node TDistributed Source Coding	2003	271
XOR-based Visual Cryptography Schemes Pim Tuyls, Henk D. L. Hollmann, J. H. van Lint, Designs Codes and Cryptography Hardware SecurityEngineeringInformation SecurityCryptographic ProtectionCryptographic Technology	2005	180
On Codes with the Identifiable Parent Property Henk D. L. Hollmann, Jack H van Lint, Jean‐Paul M. G. Linnartz, Journal of Combinatorial Theory Series A EngineeringAutomated ReasoningFormal MethodsIdentifiable Parent PropertyError Correction Code	1998	170
Polynomial time algorithms for network information flow Peter Sanders, Sebastian Egner, Ludo Tolhuizen Network ScienceGraph TheoryEngineeringNetwork AlgorithmNetwork Information Flow	2003	56
The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction] Ludo Tolhuizen IEEE Transactions on Information Theory Geometry Of NumberGeometric Graph TheoryComputational Complexity TheoryEngineeringGraph Theory	1997	48
On q-ary codes correcting all unidirectional errors of a limited magnitude Rudolf Ahlswede, Harout Aydinian, Levon H. Khachatrian, ArXiv.org EngineeringError Control TechniqueVerificationUnidirectional ErrorsQ-ary Codes	2006	36
A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with preparata parameters A.E. Brouwer, Ludo Tolhuizen Designs Codes and Cryptography Mathematical ProgrammingEngineeringJoint Source-channel CodingLower BoundJohnson Bound	1993	36
On Perfect Ternary Constant Weight Codes Jack van Lint, Ludo Tolhuizen Designs Codes and Cryptography	1999	35
Polynomial time algorithms for network code construction Sidharth Jaggi, Peter Sanders, Philip A. Chou, IEEE Transactions on Information Theory EngineeringNetwork AnalysisEducationComputational ComplexityCommunication Complexity	2005	35

Page 1