A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial L(x) = t i=0 Lixqi over Fqn . The expected time complexity of the presented ...
In this paper we present a family of ternary quasi-perfect BCH codes. These codes are of minimum distance 5 and covering radius 3. The first member of this family is the ternary qu...
We describe cs1graphics, a new Python drawing package designed with pedagogy in mind. The package is simple enough that students can sit down and make use of it from the first day...
We present a linear time and space suffix array (SA) construction algorithm called the SA-IS algorithm. The SA-IS algorithm is novel because of the LMS-substrings used for the pro...
This paper considers the problem of transmitting the difference of two positively correlated Gaussian sources over a two-user additive Gaussian noise multiple access channel (MAC)...
An analysis is presented that extends existing Rayleigh-Ritz theory to the special case of highly eccentric distributions. Specifically, a bound on the angle between the first Rit...
Rapid development of DNA sequencing technologies exponentially increases the amount of publicly available genomic data. Whole genome multiple sequence alignments represent a parti...
Pavol Hanus, Janis Dingel, Georg Chalkidis, Joachi...
Motivated by the paradigm of event-based monitoring, which can potentially alleviate the inherent bandwidth and energy constraints associated with wireless sensor networks, we con...
A current challenge in scientific computing is how to curb the growth of simulation datasets without losing valuable information. While wavelet based methods are popular, they req...