Index assignment for multichannel communication under failure

Authors:
T. Y. Berger-Wolf;E. M. Reingold
Affiliations:
Dept. of Comput. Sci., Illinois Univ., Urbana, IL;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 6

A survey of graph layout problems

ACM Computing Surveys (CSUR)
On the bandwidth of a Hamming graph

Theoretical Computer Science
Edge-bandwidth of grids and tori

Theoretical Computer Science
N-channel asymmetric entropy-constrained multiple-description lattice vector quantization

IEEE Transactions on Information Theory
A three-layer scheme for M-channel multiple description image coding

Signal Processing
A family of fast index and redundancy assignments for error resilient multiple description coding

Image Communication

Quantified Score

Hi-index	754.90

Visualization

Abstract

We consider the problem of constructing multiple description scalar quantizers and describing the achievable rate-distortion tuples in that setting. We model this as a combinatorial optimization problem of number arrangements in a matrix. This approach gives a general technique for deriving lower bounds on the distortion at given channel rates. This technique is constructive, thus allowing an algorithm that gives an upper bound. For the case of two communication channels with equal rates, the bounds coincide, thus giving the precise lowest achievable distortion at fixed rates. The bounds are within a small constant for a higher number of channels. To the best of our knowledge, this is the first result involving systems with more than two communication channels.