| Publication | Date of Publication | Type |
|---|
| Efficient Compression of Long Arbitrary Sequences With No Reference at the Encoder | 2021-02-22 | Paper |
| The Universal LZ77 Compression Algorithm Is Essentially Optimal for Individual Finite-Length $N$-Blocks | 2017-08-08 | Paper |
| On Finite Memory Universal Data Compression and Classification of Individual Sequences | 2009-02-24 | Paper |
| On the Wyner-Ziv problem for individual sequences | 2008-12-21 | Paper |
| Extremes of Information Combining | 2008-12-21 | Paper |
| Correction to: “An Efficient Universal Prediction Algorithm for Unknown Sources With Limited Training Data” | 2008-12-21 | Paper |
| Constrained Information Combining: Theory and Applications for LDPC Coded Systems | 2008-12-21 | Paper |
| On Context-Tree Prediction of Individual Sequences | 2008-12-21 | Paper |
| Classification With Finite Memory Revisited | 2008-12-21 | Paper |
| An efficient universal prediction algorithm for unknown sources with limited training data | 2005-05-11 | Paper |
| A universal prediction lemma and applications to universal data compression and prediction | 2002-08-04 | Paper |
| On the decoding of convolutional codes on an unknown channel | 2000-09-07 | Paper |
| On the universality of the LZ-based decoding algorithm | 1999-11-21 | Paper |
| On the role of pattern matching in information theory | 1999-11-21 | Paper |
| On fixed-database universal data compression with limited memory | 1999-02-04 | Paper |
| Inequalities and algorithms for universal data compression | 1998-07-13 | Paper |
| On the amount of statistical side information required for lossy data compression | 1998-01-05 | Paper |
| On sliding-window universal data compression with limited memory | 1998-01-01 | Paper |
| Universal delay estimation for discrete channels | 1997-05-12 | Paper |
| Classification with finite memory | 1997-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886033 | 1996-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858449 | 1996-04-22 | Paper |
| On encoding and decoding with two-way head machines | 1995-04-10 | Paper |
| A measure of relative entropy between individual sequences with application to universal classification | 1994-10-04 | Paper |
| Correction to "Variable-to fixed length codes are better than fixed-to-variable length codes for Markov sources" | 1993-05-16 | Paper |
| When is the generalized likelihood ratio test optimal? | 1992-10-12 | Paper |
| A sequential algorithm for the universal coding of finite memory sources | 1992-09-27 | Paper |
| On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences | 1992-06-28 | Paper |
| Estimating the number of states of a finite-state source | 1992-06-28 | Paper |
| Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm | 1992-06-28 | Paper |
| A Bayesian approach for classification of Markov sources | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3033695 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3033696 | 1990-01-01 | Paper |
| Two-dimensional encoding by finite-state encoders | 1990-01-01 | Paper |
| Variable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources | 1990-01-01 | Paper |
| Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression | 1989-01-01 | Paper |
| Estimating with partial statistics the parameters of ergodic finite Markov sources | 1989-01-01 | Paper |
| On the estimation of the order of a Markov chain and universal data compression | 1989-01-01 | Paper |
| Achievable rates for a constrained Gaussian channel | 1988-01-01 | Paper |
| On classification with empirically observed statistics and universal data compression | 1988-01-01 | Paper |
| On universal quantization | 1985-01-01 | Paper |
| Universal decoding for finite-state channels | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3744087 | 1985-01-01 | Paper |
| Fixed-rate encoding of individual sequences with side information | 1984-01-01 | Paper |
| On the power of straight- line computations in finite fields | 1982-01-01 | Paper |
| Distortion-rate theory for individual sequences | 1980-01-01 | Paper |
| Source Coding for Multiple Descriptions | 1980-01-01 | Paper |
| Coding theorems for individual sequences | 1978-01-01 | Paper |
| Compression of individual sequences via variable-rate coding | 1978-01-01 | Paper |
| Improved bounds on the local mean-square error and the bias of parameter estimators (Corresp.) | 1977-01-01 | Paper |
| A universal algorithm for sequential data compression | 1977-01-01 | Paper |
| The rate-distortion function for source coding with side information at the decoder | 1976-01-01 | Paper |
| On the Complexity of Finite Sequences | 1976-01-01 | Paper |
| Improved Lower Bounds on Signal Parameter Estimation | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4132408 | 1975-01-01 | Paper |
| On the<tex>epsilon</tex>-entropy and the rate-distortion function of certain non-Gaussian processes | 1974-01-01 | Paper |
| A theorem on the entropy of certain binary sequences and applications--I | 1973-01-01 | Paper |
| On functionals satisfying a data-processing theorem | 1973-01-01 | Paper |
| Bounds on the<tex>epsilon</tex>-entropy of Wiener and<tex>RC</tex>processes (Corresp.) | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4074748 | 1972-01-01 | Paper |
| Coding of sources with unknown statistics--I: Probability of encoding error | 1972-01-01 | Paper |
| Coding of sources with unknown statistics--II: Distortion relative to a fidelity criterion | 1972-01-01 | Paper |
| Lower and upper bounds on the optimal filtering error of certain diffusion processes | 1972-01-01 | Paper |
| Bound on the average transmission time for sequential estimation systems containing an additive Gaussian noise channel | 1971-01-01 | Paper |
| Mutual information of the white Gaussian channel with and without feedback | 1971-01-01 | Paper |
| Bounds on the rate-distortion function for stationary sources with memory | 1971-01-01 | Paper |
| Capacity of a continuous memoryless channel with feedback | 1971-01-01 | Paper |
| The channel capacity of the postal channel | 1970-01-01 | Paper |
| The behavior of analog communication systems | 1970-01-01 | Paper |
| Transmission of noisy information to a noisy receiver with minimum distortion | 1970-01-01 | Paper |
| On the threshold effect in radar range estimation (Corresp.) | 1969-01-01 | Paper |
| Some lower bounds on signal parameter estimation | 1969-01-01 | Paper |
| Binary communication over the Gaussian channel using feedback with a peak energy constraint | 1969-01-01 | Paper |
| On Communication of Analog Data from a Bounded Source Space | 1969-01-01 | Paper |
| Bounds on the Bias of Signal Parameter Estimators | 1969-01-01 | Paper |
| The capacity of the general time-discrete channel with finite alphabet | 1969-01-01 | Paper |
| Necessary and sufficient conditions for the existence of the ε-Property (A.E.P.) | 1968-01-01 | Paper |
| Asymptotic performance and complexity of a coding scheme for memoryless channels | 1967-01-01 | Paper |
| Probability of decoding error for random phase and Rayleigh fading channels | 1965-01-01 | Paper |
| Generation of optimal codes by a 'pyramid-packing' argument (Corresp.) | 1964-01-01 | Paper |
| Successive decoding scheme for memoryless channels | 1963-01-01 | Paper |
| Coding and decoding for time-discrete amplitude-continuous memoryless channels | 1962-01-01 | Paper |
