11 citations · 31 across the 7 of their papers we have counts for
8 papers
Computing preimages of Boolean Networks
Johannes Georg Klotz, Martin Bossert, Steffen Schober
In this paper we present an algorithm to address the predecessor problem of feed-forward Boolean networks. We propose an probabilistic algorithm, which solves this problem in linea…
Bounds on the Average Sensitivity of Nested Canalizing Functions
Johannes Georg Klotz, Reinhard Heckel, Steffen Schober
Nested canalizing Boolean (NCF) functions play an important role in biological motivated regulative networks and in signal processing, in particular describing stack filters. It ha…
Canalizing Boolean Functions Maximize the Mutual Information
Johannes Georg Klotz, David Kracht, Martin Bossert +1
The ability of information processing in biologically motivated Boolean networks is of interest in recent information theoretic research. One measure to quantify this ability is th…
Harmonic Analysis of Boolean Networks: Determinative Power and Perturbations
Reinhard Heckel, Steffen Schober, Martin Bossert
Consider a large Boolean network with a feed forward structure. Given a probability distribution on the inputs, can one find, possibly small, collections of input nodes that determ…
Adaptive Single-Trial Error/Erasure Decoding of Reed-Solomon Codes
Christian Senger, Vladimir R. Sidorenko, Steffen Schober +2
Algebraic decoding algorithms are commonly applied for the decoding of Reed-Solomon codes. Their main advantages are low computational complexity and predictable decoding capabilit…
Adaptive Single-Trial Error/Erasure Decoding for Binary Codes
Christian Senger, Vladimir R. Sidorenko, Steffen Schober +2
We investigate adaptive single-trial error/erasure decoding of binary codes whose decoder is able to correct e errors and t erasures if le+t<=d-1. Thereby, d is the minimum Hamming…