New results in binary multiple descriptions
IEEE Transactions on Information Theory
Source Coding Theory
Quantized Frame Expansions as Source Channel Codes for Erasure Channels
DCC '99 Proceedings of the Conference on Data Compression
Graceful Degradation over Packet Erasure Channels through Forward Error Correction
DCC '99 Proceedings of the Conference on Data Compression
Multiple Description Decoding of Overcomplete Expansions Using Projections onto Convex Sets
DCC '99 Proceedings of the Conference on Data Compression
Generalized Multiple Description Vector Quantization
DCC '99 Proceedings of the Conference on Data Compression
Multiple Description Lattice Vector Quantization
DCC '99 Proceedings of the Conference on Data Compression
ICIP '97 Proceedings of the 1997 International Conference on Image Processing (ICIP '97) 3-Volume Set-Volume 1 - Volume 1
Tree-Structured Multiple Description Coding
Journal of VLSI Signal Processing Systems
Sequencing Multiple Descriptions
DCC '02 Proceedings of the Data Compression Conference
Semidefinite Programs for the Design of Codes for Delay-Constrained Communication in Networks
DCC '01 Proceedings of the Data Compression Conference
On multiple description coding of sources with memory
IEEE Transactions on Communications
| Hi-index | 0.00 |
We consider the design of asymmetric multiple description lattice quantizers that cover the entire spectrum of the distortion profile, ranging from symmetric or balanced to successively refinable. We present a solution to a labeling problem, which is an important part of the construction, along with a general design procedure. This procedure is illustrated using a \math lattice. We also evaluate its rate-distortion performance and compare it to known information theoretic bounds.