| Publication | Date of Publication | Type |
|---|
Low-Complexity LMMSE-Based MIMO-OFDM Channel Estimation Via Angle-Domain Processing
IEEE Transactions on Signal Processing | 2018-06-27 | Paper |
| Secure key generation from biased PUFs | 2018-02-14 | Paper |
Bit-Interleaved Coded Modulation Revisited: A Mismatched Decoding Perspective
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Fundamental Limits for Privacy-Preserving Biometric Identification Systems That Support Authentication
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Identification Rate, Search and Memory Complexity Tradeoff: Fundamental Limits
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Biometric security from an information-theoretical perspective
Foundations and Trends in Communications and Information Theory | 2012-08-10 | Paper |
Two-dimensional iterative processing for DAB receivers based on trellis-decomposition
Journal of Electrical and Computer Engineering | 2012-05-09 | Paper |
| Implementing the context-tree weighting method: arithmetic coding | 2011-08-19 | Paper |
Signaling Over Arbitrarily Permuted Parallel Channels
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Bit-Interleaved Coded Modulation in the Wideband Regime
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Capacity and Codes for Embedding Information in Gray-Scale Signals
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Optimal universal coding with respect to the maximal individual relative redundancy criterion
Problems of Information Transmission | 2005-09-14 | Paper |
Communicating via a processing broadcast satellite
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
| scientific article; zbMATH DE number 2135140 (Why is no real title available?) | 2005-02-18 | Paper |
| scientific article; zbMATH DE number 1421009 (Why is no real title available?) | 2000-03-22 | Paper |
The context-tree weighting method: extensions
IEEE Transactions on Information Theory | 1998-08-02 | Paper |
Multialphabet weighted universal coding of context tree sources
Problems of Information Transmission | 1998-07-15 | Paper |
Coding for a binary independent piecewise-identically-distributed source
IEEE Transactions on Information Theory | 1997-05-12 | Paper |
Multi-alphabet universal coding of memoryless sources
Problems of Information Transmission | 1996-12-15 | Paper |
Context weighting for general finite-context sources
IEEE Transactions on Information Theory | 1996-10-22 | Paper |
The context-tree weighting method: basic properties
IEEE Transactions on Information Theory | 1996-05-27 | Paper |
A universal variable-to-fixed length source code based on Lawrence's algorithm
IEEE Transactions on Information Theory | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 4176969 (Why is no real title available?) | 1990-01-01 | Paper |
Universal data compression and repetition times
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
Dependence balance bounds for single-output two-way channels
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
Totally asynchronous Slepian-Wolf data compression
IEEE Transactions on Information Theory | 1988-01-01 | Paper |
Variable to fixed-length codes for Markov sources
IEEE Transactions on Information Theory | 1987-01-01 | Paper |
The discrete memoryless multiple-access channel with cribbing encoders
IEEE Transactions on Information Theory | 1985-01-01 | Paper |
On multiple access channels with feedback (Corresp.)
IEEE Transactions on Information Theory | 1984-01-01 | Paper |
The discrete memoryless multiple access channel with partially cooperating encoders (Corresp.)
IEEE Transactions on Information Theory | 1983-01-01 | Paper |
Partial feedback for the discrete memoryless multiple access channel (Corresp.)
IEEE Transactions on Information Theory | 1983-01-01 | Paper |
The feedback capacity region of a class of discrete memoryless multiple access channels (Corresp.)
IEEE Transactions on Information Theory | 1982-01-01 | Paper |
