activity
20132023
most citedFusion of Probability Density Functions

119 citations · 222 across the 16 of their papers we have counts for

collaborators
Showing cs.ITShow all

11 papers · 1 filter

cs.IT2023

Completion of Matrices with Low Description Complexity

Erwin Riegler, Günther Koliander, David Stotz +1

We propose a theory for matrix completion that goes beyond the low-rank structure commonly considered in the literature and applies to general matrices of low description complexit…

cs.IT2020★ 4 cited

On the Estimation of Information Measures of Continuous Distributions

Georg Pichler, Pablo Piantanida, Günther Koliander

The estimation of information measures of continuous distributions based on samples is a fundamental problem in statistics and machine learning. In this paper, we analyze estimates…

cs.IT2018

Rate-Distortion Theory for General Sets and Measures

Erwin Riegler, Günther Koliander, Helmut Bölcskei

This paper is concerned with a rate-distortion theory for sequences of i.i.d. random variables with general distribution supported on general sets including manifolds and fractal s…

cs.IT2018

Information Bottleneck on General Alphabets

Georg Pichler, Günther Koliander

We prove rigorously a source coding theorem that can probably be considered folklore, a generalization to arbitrary alphabets of a problem motivated by the Information Bottleneck m…

cs.IT2017★ 4 cited

Rate-Distortion Theory of Finite Point Processes

Günther Koliander, Dominic Schuhmacher, Franz Hlawatsch

We study the compression of data in the case where the useful information is contained in a set rather than a vector, i.e., the ordering of the data points is irrelevant and the nu…

cs.IT2016

Lossless Linear Analog Compression

Giovanni Alberti, Helmut Bölcskei, Camillo De Lellis +2

We establish the fundamental limits of lossless linear analog compression by considering the recovery of random vectors from the noisele…

cs.IT2015★ 15 cited

Entropy and Source Coding for Integer-Dimensional Singular Random Variables

Günther Koliander, Georg Pichler, Erwin Riegler +1

Entropy and differential entropy are important quantities in information theory. A tractable extension to singular random variables-which are neither discrete nor continuous-has no…

cs.IT2014★ 3 cited

Oversampling Increases the Pre-Log of Noncoherent Rayleigh Fading Channels

Meik Dörpinghaus, Günther Koliander, Giuseppe Durisi +2

We analyze the capacity of a continuous-time, time-selective, Rayleigh block-fading channel in the high signal-to-noise ratio (SNR) regime. The fading process is assumed stationary…

cs.IT2013★ 8 cited

Degrees of Freedom of Generic Block-Fading MIMO Channels without A Priori Channel State Information

Günther Koliander, Erwin Riegler, Giuseppe Durisi +1

We studynthe high-SNR capacity of generic MIMO Rayleigh block-fading channels in the noncoherent setting where neither transmitter nor receiver has a priori channel state informati…

cs.IT2013★ 2 cited

Generic Correlation Increases Noncoherent MIMO Capacity

Günther Koliander, Erwin Riegler, Giuseppe Durisi +1

We study the high-SNR capacity of MIMO Rayleigh block-fading channels in the noncoherent setting where neither transmitter nor receiver has a priori channel state information. We s…

cs.IT2013

A Lower Bound on the Noncoherent Capacity Pre-log for the MIMO Channel with Temporally Correlated Fading

Günther Koliander, Erwin Riegler, Giuseppe Durisi +2

We derive a lower bound on the capacity pre-log of a temporally correlated Rayleigh block-fading multiple-input multiple-output (MIMO) channel with T transmit antennas and R receiv…