| Publication | Date of Publication | Type |
|---|
Rate Distortion Optimization: A Joint Framework and Algorithms for Random Access Hierarchical Video Coding
IEEE Transactions on Image Processing | 2022-09-16 | Paper |
An Efficient DCT-Based Image Compression System Based on Laplacian Transparent Composite Model
IEEE Transactions on Image Processing | 2019-01-31 | Paper |
High-order spectral finite elements in analysis of collinear wave mixing
Mathematical Problems in Engineering | 2018-08-27 | Paper |
Quantization Table Design Revisited for Image/Video Coding
IEEE Transactions on Image Processing | 2017-11-20 | Paper |
Transparent Composite Model for DCT Coefficients: Design and Analysis
IEEE Transactions on Image Processing | 2017-11-20 | Paper |
Joint Optimization of Run-Length Coding, Huffman Coding, and Quantization Table With Complete Baseline JPEG Decoder Compatibility
IEEE Transactions on Image Processing | 2017-10-09 | Paper |
Down-Sampling Design in DCT Domain With Arbitrary Ratio for Image/Video Transcoding
IEEE Transactions on Image Processing | 2017-10-09 | Paper |
Joint watermarking and compression using scalar quantization for maximizing robustness in the presence of additive Gaussian attacks
IEEE Transactions on Signal Processing | 2017-09-20 | Paper |
On the Linear Codebook-Level Duality Between Slepian–Wolf Coding and Channel Coding
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
On the Redundancy of Slepian–Wolf Coding
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Design and Analysis of Optimal Noisy Channel Quantization With Random Index Assignment
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Interactive Encoding and Decoding for One Way Learning: Near Lossless Recovery With Side Information at the Decoder
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Linear Interactive Encoding and Decoding for Lossless Source Coding With Decoder Only Side Information
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Rate Distortion Theory for Causal Video Coding: Characterization, Computation Algorithm, and Comparison
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Interactive Encoding and Decoding Based on Binary LDPC Codes With Syndrome Accumulation
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
A Universal Grammar-Based Code for Lossless Compression of Binary Trees
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Capacity Analysis of Linear Operator Channels Over Finite Fields
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
On the Information Theoretic Performance Comparison of Causal Video Coding and Predictive Video Coding
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
New Nonasymptotic Channel Coding Theorems for Structured Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
On Information Embedding When Watermarks and Covertexts are Correlated
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Performance Analysis of Grammar-Based Codes Revisited
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
The Universality of Grammar-Based Codes for Sources With Countably Infinite Alphabets
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Context-dependent multilevel pattern matching for lossless image compression
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Problems on Sequences: Information Theory and Computer Science Interface
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Grammar-Based Lossless Universal Refinement Source Coding
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Universal compression of ergodic quantum sources
(available as arXiv preprint) | 2008-09-03 | Paper |
Structured grammar-based codes for universal lossless data compression.
Communications in Information and Systems | 2004-03-22 | Paper |
Throughput analysis of CDMA systems using multiuser receivers
IEEE Transactions on Communications | 2003-06-10 | Paper |
The redundancy of source coding with a fidelity criterion .II. Coding at a fixed rate level with unknown statistics
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Universal lossless data compression with side information by using a conditional MPM grammar transform
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Universal lossless compression via multilevel pattern matching
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
The shortest common superstring problem: average case analysis for both exact and approximate matching
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Grammar-based codes: a new class of universal lossless source codes
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Arithmetic coding with dual symbol sets and its performance analysis
IEEE Transactions on Image Processing | 2000-09-06 | Paper |
| scientific article; zbMATH DE number 1421010 (Why is no real title available?) | 2000-09-04 | Paper |
| scientific article; zbMATH DE number 1445329 (Why is no real title available?) | 2000-05-10 | Paper |
On the redundancy of lossy source coding with abstract alphabets
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Variable-rate trellis source encoding
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
An on-line universal lossy data compression algorithm via continuous codebook refinement .III. Redundancy analysis
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
On the performance of data compression algorithms based upon string matching
IEEE Transactions on Information Theory | 1999-02-09 | Paper |
An on-line universal lossy data compression algorithm via continuous codebook refinement. II. Optimality for phi-mixing source models
IEEE Transactions on Information Theory | 1998-07-03 | Paper |
Fixed-slope universal lossy data compression
IEEE Transactions on Information Theory | 1998-02-17 | Paper |
Identification via compressed data
IEEE Transactions on Information Theory | 1997-10-09 | Paper |
On the redundancy of the fixed-database Lempel-Ziv algorithm for φ-mixing sources
IEEE Transactions on Information Theory | 1997-09-18 | Paper |
Ergodic behavior of graph entropy
Electronic Research Announcements of the American Mathematical Society | 1997-06-15 | Paper |
The redundancy of source coding with a fidelity criterion. 1. Known statistics
IEEE Transactions on Information Theory | 1997-05-22 | Paper |
Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity
IEEE Transactions on Information Theory | 1996-07-29 | Paper |
Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm
IEEE Transactions on Information Theory | 1996-07-29 | Paper |
Limit theorems for Chaitin complexity
Chinese Science Bulletin | 1993-08-16 | Paper |
Distortion program-size complexity with respect to a fidelity criterion and rate-distortion function
IEEE Transactions on Information Theory | 1993-05-16 | Paper |
Chaitin complexity, Shannon information content of a single event, and infinite random sequences. II
Science in China. Series A | 1993-01-17 | Paper |
| scientific article; zbMATH DE number 78498 (Why is no real title available?) | 1992-12-14 | Paper |
Chaitin complexity, Shannon information content of a single event and infinite random sequences. I
Science in China. Series A | 1992-06-27 | Paper |
The proof of Levin's conjecture
Chinese Science Bulletin | 1989-01-01 | Paper |
