| Publication | Date of Publication | Type |
|---|
| Asymptotically Tight Bounds on the Depth of Estimated Context Trees | 2019-03-28 | Paper |
| The iDUDE Framework for Grayscale Image Denoising | 2017-10-19 | Paper |
| Twice-Universal Simulation of Markov Sources and Individual Sequences | 2017-07-27 | Paper |
| Type Classes of Context Trees | 2017-07-12 | Paper |
| Optimal Prefix Codes for Pairs of Geometrically Distributed Random Variables | 2017-06-08 | Paper |
| Deinterleaving Finite Memory Processes Via Penalized Maximum Likelihood | 2017-06-08 | Paper |
| Universal Enumerative Coding for Tree Models | 2017-05-16 | Paper |
| Optimal Algorithms for Universal Random Number Generation From Finite Memory Sources | 2017-04-28 | Paper |
| Space-efficient representation of truncated suffix trees, with applications to Markov order estimation | 2015-07-24 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Universal Algorithms for Channel Decoding of Uncompressed Sources | 2009-02-24 | Paper |
| Universal Delay-Limited Simulation | 2009-02-24 | Paper |
| Linear Time Universal Coding and Time Reversal of Tree Sources Via FSM Closure | 2008-12-21 | Paper |
| Symbol-Intersecting Codes | 2008-12-21 | Paper |
| On universal types | 2008-12-21 | Paper |
| Universal discrete denoising: known channel | 2008-12-21 | Paper |
| Bounds for Binary Codes With Narrow Distance Distributions | 2008-12-21 | Paper |
| On the entropy of a hidden Markov process | 2008-07-10 | Paper |
| On the number of \(t\)-ary trees with a given path length | 2007-02-14 | Paper |
| On sequential strategies for loss functions with memory | 2005-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736431 | 2004-08-09 | Paper |
| Optimal prefix codes for sources with two-sided geometric distributions | 2000-09-07 | Paper |
| Coding of sources with two-sided geometric distributions and unknown parameters | 2000-09-07 | Paper |
| Reduced-redundancy product codes for burst error correction | 1999-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4265362 | 1999-10-11 | Paper |
| Sequential prediction and ranking in universal context modeling and data compression | 1998-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4354780 | 1997-09-17 | Paper |
| Location-correcting codes | 1997-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858446 | 1996-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279521 | 1994-02-17 | Paper |
| Systematic derivation of spline bases | 1993-01-18 | Paper |
| Explicit formulas for self-complementary normal bases in certain finite fields | 1992-06-26 | Paper |
| Boolean circuits versus arithmetic circuits | 1991-01-01 | Paper |
| A systolic Reed-Solomon encoder | 1991-01-01 | Paper |
| Generalizations of the Normal Basis Theorem of Finite Fields | 1990-01-01 | Paper |
| Encoding and decoding of BCH codes using light and short codewords | 1988-01-01 | Paper |
| Vector sets for exhaustive testing of logic circuits | 1988-01-01 | Paper |
| On cyclic MDS codes of length q over GF(q) (Corresp.) | 1986-01-01 | Paper |
| On MDS extensions of generalized Reed- Solomon codes | 1986-01-01 | Paper |
| On generator matrices of MDS codes (Corresp.) | 1985-01-01 | Paper |
| On the minimum distance of some quadratic residue codes (Corresp.) | 1984-01-01 | Paper |
| On symmetric algorithms for bilinear forms over finite fields | 1984-01-01 | Paper |
| On the arithmetic complexity of matrix Kronecker powers | 1983-01-01 | Paper |
| On the complexity of multiplication in finite fields | 1983-01-01 | Paper |
| Maximum likelihood decoding of certain Reed - Muller codes (Corresp.) | 1983-01-01 | Paper |
| On Symmetric Representations of Finite Fields | 1983-01-01 | Paper |
| On the power of straight- line computations in finite fields | 1982-01-01 | Paper |
| Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields | 1980-01-01 | Paper |
| Efficient Quantum Algorithms for Estimating Gauss Sums | 0001-01-03 | Paper |
