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