Filtyp
This paper presents new versions of the McEliece PKC that use time-varying convolutional codes. In opposite to the choice of Goppa codes, the proposed construction uses large parts of randomly generated parity-checks, presumably making structured attacks more difficult. The drawback is that we have a small but nonzero probability of not being successful in decoding, in which case we need to ask fo
This paper presents an approach to teaching programming and abstract thinking to young learners using Scala and Kojo. Kojo is an open source IDE for the Scala programming language. The approach is based on Scala APIs for turtle graphics and functional pictures, a process of interactive exploration and discovery, and structured learning material that guides learners. The approach encourages playful
A differential LNA using capacitive shunt feedback is demonstrated in 65nm CMOS. The capacitive shunt feedback structure gives a wideband input matching, S11 <;-17 dB from 500MHz - 1 GHz for low band and S11 <;-20 dB from 1.1 GHz - 2.3GHz for high band. The NF for the complete receiver chain in low band and high band was measured to 3.3 dB and 3.9 dB, respectively. The 1-dB compression point with
The goal of the paper is to present a distributed scheme to resolving a single path routing problem in multidomain networks. The global problem is formulated as a mixed-integer program (MIP) and approached by means of branch-and-price (B&P). Problems associated with a B&P tree nodes are decomposed using the Dantzig-Wolfe method to a set of domain subproblems coordinated by a single master
We consider the problem of providing trusted computing functionality in high availability systems. We consider the case where data is required to be encrypted with a TPM protected key. For redundancy, and to facilitate high availability, the same TPM key is stored in multiple computational units, each one ready to take over if the main unit breaks down. This requires the TPM key to be migratable.
The traditional routing protocols used in wireless mesh networks like AODV are not very efficient since the number of hops to a destination is mainly considered as the routing metric. This may lead to shorter paths; however, the throughput can decrease when traffic is routed through those paths. Various contributions have proposed different metrics or completely different routing algorithms. Never
Spatially coupled regular LDPC code ensembles have outstanding performance with belief propagation decoding and can perform close to the Shannon limit. In this paper we investigate the suitability of coupled regular LDPC code ensembles with respect to rate-flexibility. Regular ensembles with good performance and low complexity exist for a variety of specific code rates. On the other hand it can be
In this paper we evaluate the use of parallel interleavers for user separation in coded IDMA systems. The parallel interleavers have previously been evaluated for uncoded systems, and we here present extended results for the coded case. The new results are important for real systems, as they will most likely use performance enhancing channel coding. The parallel interleavers are designed to remove
The fast correlation attack is a general cryptanalytic attack directed at stream ciphers and is related to the decoding of low-density parity-check (LDPC) codes. In this paper, we improve the message passing algorithm by exploiting the fact that the sum of an arbitrary number of initial state variables, called a fixed point, can be written as the sum of only a few other variables. This will result
We consider the problem of detecting exploits based on return-oriented programming. In contrast to previous works we investigate to which extent we can detect ROP payloads by only analysing streaming data, i.e., we do not assume any modifications to the target machine, its kernel or its libraries. Neither do we attempt to execute any potentially malicious code in order to determine if it is an att
We present a model for supporting scoping decisions that is based on an analysis of the ROI for a given feature. Employing a ROI threshold value for making scoping decisions, the utility of the model was investigated using data from a single large project and identified a group of outlying features responsible for a disproportionate wasted investment. These initial results are promising and indica
Test managers have to repeatedly select test cases for test activities during evolution of large software systems. Researchers have widely studied automated test scoping, but have not fully investigated decision support with human interaction. We previously proposed the introduction of visual analytics for this purpose. Aim: In this empirical study we investigate how to design such decision suppor
We consider distributed model predictive control (DMPC) where a sparse centralized optimization problem without a terminal cost or a terminal constraint set is solved in distributed fashion. Distribution of the optimization algorithm is enabled by dual decomposition. Gradient methods are usually used to solve the dual problem resulting from dual decomposition. However, gradient methods are known f
In this paper, we investigate the impact of spatial coupling on the thresholds of turbo-like codes. Parallel concatenated and serially concatenated convolutional codes as well as braided convolutional codes (BCCs) are compared by means of an exact density evolution (DE) analysis for the binary erasure channel (BEC). We propose two extensions of the original BCC ensemble to improve its threshold an
We consider the classical 3-state Moore-Greitzer model, which is commonly used for approximating dynamics of deviations of flow and pressure variables in an axial compressor from their nominal steady-state values. The linearization of the nonlinear system is not controllable and, therefore, even local asymptotic stability cannot be achieved using methods of linear control theory. We propose a fami
