The following pages link to Enhui Yang (Q1180010):
Displayed 50 items.
- Chaitin complexity, Shannon information content of a single event and infinite random sequences. I (Q1180011) (← links)
- Chaitin complexity, Shannon information content of a single event, and infinite random sequences. II (Q1201558) (← links)
- The proof of Levin's conjecture (Q1263857) (← links)
- Structured grammar-based codes for universal lossless data compression. (Q1421045) (← links)
- High-order spectral finite elements in analysis of collinear wave mixing (Q1665121) (← links)
- Limit theorems for Chaitin complexity (Q2367861) (← links)
- New Nonasymptotic Channel Coding Theorems for Structured Codes (Q2977257) (← links)
- Capacity Analysis of Linear Operator Channels Over Finite Fields (Q2986229) (← links)
- A Universal Grammar-Based Code for Lossless Compression of Binary Trees (Q2986464) (← links)
- On the Information Theoretic Performance Comparison of Causal Video Coding and Predictive Video Coding (Q2986468) (← links)
- Interactive Encoding and Decoding Based on Binary LDPC Codes With Syndrome Accumulation (Q2989273) (← links)
- (Q3522448) (← links)
- Performance Analysis of Grammar-Based Codes Revisited (Q3547013) (← links)
- The Universality of Grammar-Based Codes for Sources With Countably Infinite Alphabets (Q3547014) (← links)
- Context-dependent multilevel pattern matching for lossless image compression (Q3547070) (← links)
- Problems on Sequences: Information Theory and Computer Science Interface (Q3547137) (← links)
- Grammar-Based Lossless Universal Refinement Source Coding (Q3547138) (← links)
- Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models (Q3547843) (← links)
- On Information Embedding When Watermarks and Covertexts are Correlated (Q3604718) (← links)
- (Q4016320) (← links)
- Distortion program-size complexity with respect to a fidelity criterion and rate-distortion function (Q4034471) (← links)
- Identification via compressed data (Q4336284) (← links)
- The redundancy of source coding with a fidelity criterion. 1. Known statistics (Q4336285) (← links)
- Ergodic behavior of graph entropy (Q4340894) (← links)
- On the redundancy of the fixed-database Lempel-Ziv algorithm for φ-mixing sources (Q4345604) (← links)
- Fixed-slope universal lossy data compression (Q4371888) (← links)
- On the performance of data compression algorithms based upon string matching (Q4392484) (← links)
- Universal lossless compression via multilevel pattern matching (Q4501756) (← links)
- Arithmetic coding with dual symbol sets and its performance analysis (Q4503260) (← links)
- The shortest common superstring problem: average case analysis for both exact and approximate matching (Q4503372) (← links)
- Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models (Q4503584) (← links)
- Grammar-based codes: a new class of universal lossless source codes (Q4503585) (← links)
- The redundancy of source coding with a fidelity criterion .II. Coding at a fixed rate level with unknown statistics (Q4544459) (← links)
- Universal lossless data compression with side information by using a conditional MPM grammar transform (Q4544660) (← links)
- Throughput analysis of CDMA systems using multiuser receivers (Q4553046) (← links)
- Transparent Composite Model for DCT Coefficients: Design and Analysis (Q4592090) (← links)
- Quantization Table Design Revisited for Image/Video Coding (Q4592543) (← links)
- An Efficient DCT-Based Image Compression System Based on Laplacian Transparent Composite Model (Q4612698) (← links)
- An on-line universal lossy data compression algorithm via continuous codebook refinement .III. Redundancy analysis (Q4701157) (← links)
- Variable-rate trellis source encoding (Q4701305) (← links)
- On the redundancy of lossy source coding with abstract alphabets (Q4701363) (← links)
- Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity (Q4879987) (← links)
- Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm (Q4880007) (← links)
- An on-line universal lossy data compression algorithm via continuous codebook refinement. II. Optimality for phi-mixing source models (Q4887060) (← links)
- (Q4945084) (← links)
- (Q4952646) (← links)
- On the Linear Codebook-Level Duality Between Slepian–Wolf Coding and Channel Coding (Q4974098) (← links)
- On the Redundancy of Slepian–Wolf Coding (Q4974100) (← links)
- Rate Distortion Optimization: A Joint Framework and Algorithms for Random Access Hierarchical Video Coding (Q5106034) (← links)
- Rate Distortion Theory for Causal Video Coding: Characterization, Computation Algorithm, and Comparison (Q5273485) (← links)