| Publication | Date of Publication | Type |
|---|
The iDUDE Framework for Grayscale Image Denoising
IEEE Transactions on Image Processing | 2017-10-19 | Paper |
Universal Simulation With Fidelity Criteria
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Twice-Universal Simulation of Markov Sources and Individual Sequences
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Type Classes of Context Trees
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Minimax Pointwise Redundancy for Memoryless Models Over Large Alphabets
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
On Multi-Directional Context Sets
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Twice-Universal Denoising
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Deinterleaving Finite Memory Processes Via Penalized Maximum Likelihood
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Universal Enumerative Coding for Tree Models
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Optimal Algorithms for Universal Random Number Generation From Finite Memory Sources
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Universal Delay-Limited Simulation
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
A Distribution Dependent Refinement of Pinsker's Inequality
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Universal discrete denoising: known channel
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Universal Filtering Via Prediction
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Linear Time Universal Coding and Time Reversal of Tree Sources Via FSM Closure
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
On Universal Simulation of Information Sources Using Training Data
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Addendum to “On Universal Simulation of Information Sources Using Training Data”
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
On sequential strategies for loss functions with memory
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
On delayed prediction of individual sequences
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
Optimal prefix codes for sources with two-sided geometric distributions
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Coding of sources with two-sided geometric distributions and unknown parameters
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Sequential prediction and ranking in universal context modeling and data compression
IEEE Transactions on Information Theory | 1998-04-13 | 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 |
Predictive stochastic complexity and model estimation for finite-state processes
Journal of Statistical Planning and Inference | 1994-07-12 | Paper |
A sequential algorithm for the universal coding of finite memory sources
IEEE Transactions on Information Theory | 1992-09-27 | Paper |
Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm
IEEE Transactions on Information Theory | 1992-06-28 | Paper |
On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences
IEEE Transactions on Information Theory | 1992-06-28 | Paper |
Factorization of symmetric circulant matrices in finite fields
Discrete Applied Mathematics | 1990-01-01 | Paper |
Self-Complementary Normal Bases in Finite Fields
SIAM Journal on Discrete Mathematics | 1988-01-01 | Paper |
