| Publication | Date of Publication | Type |
|---|
| Optimal Sampling of a Bandlimited Noisy Multiple Output Channel | 2022-09-23 | Paper |
| k-Vectors: An Alternating Minimization Algorithm for Learning Regression Functions | 2020-12-04 | Paper |
| Innovation Representation of Stochastic Processes With Application to Causal Inference | 2020-01-28 | Paper |
| Linear Independent Component Analysis Over Finite Fields: Algorithms and Bounds | 2019-02-12 | Paper |
| Large Alphabet Source Coding Using Independent Component Analysis | 2018-06-27 | Paper |
| Achieving the Empirical Capacity Using Feedback: Memoryless Additive Models | 2017-08-08 | Paper |
| Optimal Feedback Communication Via Posterior Matching | 2017-07-27 | Paper |
| Efficient Network Code Design for Cyclic Networks | 2017-07-27 | Paper |
| Communication Over Individual Channels | 2017-07-12 | Paper |
| Signal Codes: Convolutional Lattice Codes | 2017-07-12 | Paper |
| Universal Communication Over Arbitrarily Varying Channels | 2017-06-08 | Paper |
| The Jacobi MIMO Channel | 2017-06-08 | Paper |
| Finite-Dimensional Infinite Constellations | 2017-06-08 | Paper |
| Fundamental Limits of Infinite Constellations in MIMO Fading Channels | 2017-06-08 | Paper |
| Universal Communication—Part I: Modulo Additive Channels | 2017-06-08 | Paper |
| Delay and Redundancy in Lossless Source Coding | 2017-05-16 | Paper |
| Finite-Memory Prediction as Well as the Empirical Mean | 2017-05-16 | Paper |
| Universal Communication—Part II: Channels With Memory | 2017-05-16 | Paper |
| A Simple Proof for the Optimality of Randomized Posterior Matching | 2017-04-28 | Paper |
| Collaboration in Multiple Access Channels Requires Synchronization | 2017-04-28 | Paper |
| Generalized Independent Component Analysis Over Finite Alphabets | 2017-04-28 | Paper |
| Non-Random Coding Error Bounds for Lattices | 2017-04-28 | Paper |
| The Random Coding Bound Is Tight for the Average Linear Code or Lattice | 2017-04-28 | Paper |
| On the Diversity-Multiplexing Tradeoff of Unconstrained Multiple-Access Channels | 2017-04-28 | Paper |
| Finding the Closest Lattice Point by Iterative Slicing | 2010-06-01 | Paper |
| Low-Density Lattice Codes | 2009-02-24 | Paper |
| Bounds on Achievable Rates of LDPC Codes Used Over the Binary Erasure Channel | 2008-12-21 | Paper |
| Finite-Memory Universal Prediction of Individual Sequences | 2008-12-21 | Paper |
| Universal Decoding for Frequency-Selective Fading Channels | 2008-12-21 | Paper |
| The Uniform Distribution as a Universal Prior | 2008-12-21 | Paper |
| Distortion Bounds for Broadcasting With Bandwidth Expansion | 2008-12-21 | Paper |
| Minimax Universal Decoding With an Erasure Option | 2008-12-21 | Paper |
| Improving the generalized likelihood ratio test for unknown linear gaussian channels | 2005-06-01 | Paper |
| Universal composite hypothesis testing: a competitive minimax approach | 2005-05-11 | Paper |
| Universal linear least squares prediction: upper and lower bounds | 2005-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3154858 | 2005-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473327 | 2004-08-04 | Paper |
| Vector sampling expansion | 2003-06-19 | Paper |
| Analysis and synthesis of 1/f processes via Shannon wavelets | 2003-06-16 | Paper |
| A novel decoder for unknown diversity channels employing space-time codes | 2003-03-20 | Paper |
| Universal linear prediction by model order weighting | 2001-12-02 | Paper |
| Random coding techniques for nonrandom codes | 2000-09-07 | Paper |
| Improved error exponent for time-invariant and periodically time-variant convolutional codes | 2000-09-07 | Paper |
| Universal decoding for channels with memory | 1999-11-21 | Paper |
| Universal prediction | 1999-11-21 | Paper |
| On the volume of the Minkowski sum of line sets and the entropy-power inequality | 1999-11-21 | Paper |
| Hierarchical universal coding | 1997-04-28 | Paper |
| On lattice quantization noise | 1997-02-25 | Paper |
| Information rates of pre/post-filtered dithered quantizers | 1996-10-22 | Paper |
| Rate-distortion performance in coding bandlimited sources by sampling and dithered quantization | 1996-02-04 | Paper |
| A strong version of the redundancy-capacity theorem of universal coding | 1995-09-25 | Paper |
| A universal finite memory source | 1995-09-11 | Paper |
| Optimal sequential probability assignment for individual sequences | 1995-04-18 | Paper |
| Relations between entropy and error probability | 1994-10-04 | Paper |
| Universal schemes for sequential decision from individual data sequences | 1994-10-04 | Paper |
| A generalization of the entropy power inequality with applications | 1994-10-03 | Paper |
| Predictive stochastic complexity and model estimation for finite-state processes | 1994-07-12 | Paper |
| Some properties of sequential predictors for binary Markov sources | 1994-02-07 | Paper |
| Parameter Estimation and Extraction of Helicopter Signals Observed with a Wide-Band Interference | 1993-05-16 | Paper |
| Universal prediction of individual sequences | 1992-10-11 | Paper |
| On universal quantization by randomized uniform/lattice quantizers | 1992-06-28 | Paper |
| A note on the competitive optimality of the Huffman code | 1992-06-28 | Paper |
| Sequential algorithms for parameter estimation based on the Kullback-Leibler information measure | 1990-01-01 | Paper |
| Parameter estimation of superimposed signals using the EM algorithm | 1988-01-01 | Paper |
| Maximum entropy as a special case of the minimum description length criterion (Corresp.) | 1986-01-01 | Paper |
