39 citations · 51 across the 6 of their papers we have counts for
7 papers
Efficient sequential compression of multi-channel biomedical signals
Ignacio Capurro, Federico Lecumberry, Álvaro Martín +3
This work proposes lossless and near-lossless compression algorithms for multi-channel biomedical signals. The algorithms are sequential and efficient, which makes them suitable fo…
Optimal algorithms for universal random number generation from finite memory sources
Gadiel Seroussi, Marcelo J. Weinberger
We study random number generators (RNGs), both in the fixed to variable-length (FVR) and the variable to fixed-length (VFR) regimes, in a universal setting in which the input is a…
Deinterleaving Finite Memory Processes via Penalized Maximum Likelihood
Gadiel Seroussi, Wojciech Szpankowski, Marcelo J. Weinberger
We study the problem of deinterleaving a set of finite-memory (Markov) processes over disjoint finite alphabets, which have been randomly interleaved by a finite-memory switch. The…
Optimal prefix codes for pairs of geometrically-distributed random variables
Frédérique Bassino, Julien Clément, Gadiel Seroussi +1
Optimal prefix codes are studied for pairs of independent, integer-valued symbols emitted by a source with a geometric probability distribution of parameter , . By en…
On Hats and other Covers
Hendrik W. Lenstra, Gadiel Seroussi
We study a game puzzle that has enjoyed recent popularity among mathematicians, computer scientist, coding theorists and even the mass press. In the game, players are fitted wi…
On the number of t-ary trees with a given path length
Gadiel Seroussi
We show that the number of -ary trees with path length equal to is , where $\entropy(x){=}{-}x\log x {-}(1{-}x)\log (1{-}x)$…