In an application, where a client wants to obtain many symbols from a large database, it is often desirable to balance the load. Batch codes (introduced by Ishai et al. in STOC 2004) do exactly that: the large database is divided between many servers, so that the client has to only make a small number of queries to every server to obtain sufficient information to reconstruct all desired symbols...

Abstract. We present a new method for the fast reconstruction of a function f from its samples f(xj) under the assumption that f belongs to a shift invariant space V (φ). If the generator φ has compact support, then the reconstruction is local quite in contrast to methods based on band-limited functions. Using frame theoretic arguments, we show that the matrix of the corresponding linear system...

In this paper, a novel non-contiguous non-systematic coded unique word (UW)-OFDM system is proposed to opportunistically transmit data on the spectrum holes available in a cognitive radio network. In such a system, the spectral sidelobes of the active subcarriers interfere with the adjacent spectral band used by the primary system. In the proposed scheme, the code generator matrix of the UW-OFD...

Löndahl and Johansson proposed last year a variant of the McEliece cryptosystem which replaces Goppa codes by convolutional codes. This modification is supposed to make structural attacks more difficult since the public generator matrix of this scheme contains large parts which are generated completely at random. They proposed two schemes of this kind, one of them consists in taking a Goppa cod...

A Lorentz covariant matrix regularization of membrane thories is studied. It is shown that the action for a bosonic membrane can be defined by matrix regularization in a Lorentz covariant manner. The generator of area preserving diffeomorphism can also be consistently defined by matrix regularization, and we can make the area preserving gauge symmetry manifest. However, the reparametrization BR...

Achieving peak performance in important numerical kernels such as dense matrix multiply or sparse-matrix vector multiplication usually requires extensive, machine-dependent tuning by hand. In response, a number automatic tuning systems have been developed which typically operate by (1) generating multiple implementations of a kernel, and (2) empirically selecting an optimal implementation. One ...

Achieving peak performance in important numerical kernels such as dense matrix multiply or sparse-matrix vector multiplication usually requires extensive, machine-dependent tuning by hand. In response, a number automatic tuning systems have been developed which typically operate by (1) generating multiple implementations of a kernel, and (2) empirically selecting an optimal implementation. One ...

Funding information UK-EPSRC Grant ‘Attosecond Electron Dynamics in Molecular and Condensed Phase Systems’, Grant/Award Number: EP/I032517/1 Abstract We present an implementation of the spin-dependent unitary group approach to calculate spin densities for configuration interaction calculations in a basis of spin symmetry-adapted functions. Using S eigenfunctions helps to reduce the size of conf...