Enhui Yang

From MaRDI portal
Person:1180010

Available identifiers

zbMath Open yang.enhuiMaRDI QIDQ1180010

List of research outcomes





PublicationDate of PublicationType
Rate Distortion Optimization: A Joint Framework and Algorithms for Random Access Hierarchical Video Coding2022-09-16Paper
An Efficient DCT-Based Image Compression System Based on Laplacian Transparent Composite Model2019-01-31Paper
High-order spectral finite elements in analysis of collinear wave mixing2018-08-27Paper
Quantization Table Design Revisited for Image/Video Coding2017-11-20Paper
Transparent Composite Model for DCT Coefficients: Design and Analysis2017-11-20Paper
Joint Optimization of Run-Length Coding, Huffman Coding, and Quantization Table With Complete Baseline JPEG Decoder Compatibility2017-10-09Paper
Down-Sampling Design in DCT Domain With Arbitrary Ratio for Image/Video Transcoding2017-10-09Paper
Joint watermarking and compression using scalar quantization for maximizing robustness in the presence of additive Gaussian attacks2017-09-20Paper
On the Linear Codebook-Level Duality Between Slepian–Wolf Coding and Channel Coding2017-08-08Paper
On the Redundancy of Slepian–Wolf Coding2017-08-08Paper
Design and Analysis of Optimal Noisy Channel Quantization With Random Index Assignment2017-07-27Paper
Interactive Encoding and Decoding for One Way Learning: Near Lossless Recovery With Side Information at the Decoder2017-07-27Paper
Linear Interactive Encoding and Decoding for Lossless Source Coding With Decoder Only Side Information2017-07-12Paper
Rate Distortion Theory for Causal Video Coding: Characterization, Computation Algorithm, and Comparison2017-07-12Paper
Interactive Encoding and Decoding Based on Binary LDPC Codes With Syndrome Accumulation2017-06-08Paper
A Universal Grammar-Based Code for Lossless Compression of Binary Trees2017-05-16Paper
Capacity Analysis of Linear Operator Channels Over Finite Fields2017-05-16Paper
On the Information Theoretic Performance Comparison of Causal Video Coding and Predictive Video Coding2017-05-16Paper
New Nonasymptotic Channel Coding Theorems for Structured Codes2017-04-28Paper
On Information Embedding When Watermarks and Covertexts are Correlated2009-02-24Paper
Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models2008-12-21Paper
Performance Analysis of Grammar-Based Codes Revisited2008-12-21Paper
The Universality of Grammar-Based Codes for Sources With Countably Infinite Alphabets2008-12-21Paper
Context-dependent multilevel pattern matching for lossless image compression2008-12-21Paper
Problems on Sequences: Information Theory and Computer Science Interface2008-12-21Paper
Grammar-Based Lossless Universal Refinement Source Coding2008-12-21Paper
Universal compression of ergodic quantum sources2008-09-03Paper
Structured grammar-based codes for universal lossless data compression.2004-03-22Paper
Throughput analysis of CDMA systems using multiuser receivers2003-06-10Paper
The redundancy of source coding with a fidelity criterion .II. Coding at a fixed rate level with unknown statistics2002-08-04Paper
Universal lossless data compression with side information by using a conditional MPM grammar transform2002-08-04Paper
Universal lossless compression via multilevel pattern matching2000-09-07Paper
The shortest common superstring problem: average case analysis for both exact and approximate matching2000-09-07Paper
Grammar-based codes: a new class of universal lossless source codes2000-09-07Paper
Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models2000-09-07Paper
Arithmetic coding with dual symbol sets and its performance analysis2000-09-06Paper
https://portal.mardi4nfdi.de/entity/Q49450842000-09-04Paper
https://portal.mardi4nfdi.de/entity/Q49526462000-05-10Paper
On the redundancy of lossy source coding with abstract alphabets1999-11-21Paper
Variable-rate trellis source encoding1999-11-21Paper
An on-line universal lossy data compression algorithm via continuous codebook refinement .III. Redundancy analysis1999-11-21Paper
On the performance of data compression algorithms based upon string matching1999-02-09Paper
An on-line universal lossy data compression algorithm via continuous codebook refinement. II. Optimality for phi-mixing source models1998-07-03Paper
Fixed-slope universal lossy data compression1998-02-17Paper
Identification via compressed data1997-10-09Paper
On the redundancy of the fixed-database Lempel-Ziv algorithm for φ-mixing sources1997-09-18Paper
Ergodic behavior of graph entropy1997-06-15Paper
The redundancy of source coding with a fidelity criterion. 1. Known statistics1997-05-22Paper
Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity1996-07-29Paper
Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm1996-07-29Paper
Limit theorems for Chaitin complexity1993-08-16Paper
Distortion program-size complexity with respect to a fidelity criterion and rate-distortion function1993-05-16Paper
Chaitin complexity, Shannon information content of a single event, and infinite random sequences. II1993-01-17Paper
https://portal.mardi4nfdi.de/entity/Q40163201992-12-14Paper
Chaitin complexity, Shannon information content of a single event and infinite random sequences. I1992-06-27Paper
The proof of Levin's conjecture1989-01-01Paper

Research outcomes over time

This page was built for person: Enhui Yang