Andreas Klein
Ghent University
60 Papers
238 Citations
Andreas Klein is an academic researcher from Ghent University. The author has contributed to research in topics: Nondeterministic algorithm & Finite-state machine. The author has an hindex of 12, co-authored 60 publications. Previous affiliations of Andreas Klein include University of Kassel & University of Giessen.
Chat about Author
Papers
Small maximal partial spreads in classical finite polar spaces
TL;DR: Lower bounds on the size of small maximal partial spreads in Q(4n + 1, q), W (2n+1, q) and H(2n−1, Q) were proved in this paper.
26
Linear Feedback Shift Registers
Andreas Klein
- 01 Jan 2013
TL;DR: This chapter will review the part of the theory that is needed for LFSRs to be used as basis for ciphers, with a focus on the algorithmic parts.
24
On codes meeting the Griesmer bound
TL;DR: The main theorem of this article is the generalization of the nonexistence theorem of Maruta to a larger class of codes meeting the Griesmer bound.
23
Iterative Arrays with Small Time Bounds
Thomas Buchholz,Andreas Klein,Martin Kutrib +2 more
- 01 Sep 2000
TL;DR: In this paper, the authors investigated deterministic iterative arrays with small time bounds between real-time and linear-time, and showed that there exists an infinite dense hierarchy of strictly included complexity classes in that range.
A Generalized Kahan-Babuška-Summation-Algorithm
TL;DR: This article combines recursive summation techniques with Kahan-Babuška type balancing strategies to get highly accurate summation formulas and shows that these algorithms could be modified to provide tight upper and lower bounds for use with interval arithmetic.
20