Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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
Design of Asymmetric Multiple Description Lattice Vector Quantizers
DCC '00 Proceedings of the Conference on Data Compression
IEEE Transactions on Information Theory
Sequencing Multiple Descriptions
DCC '02 Proceedings of the Data Compression Conference
| Hi-index | 0.00 |
Abstract: We consider the problem of designing codes for the problem of delay-constrained communication in packet networks. We show how good codes for this problem can be characterized as the solution of a pair of semidefinite programs plus a rank constraint. Using this characterization, we formulate the design problem as one of finding suitable graph embeddings into euclidean space, for a certain family of graphs which represent constraints that these codes must satisfy. In the case of codes in dimension 1, our formulation results in a good approximation algorithm for the classical problem of graph bandwidth, which may be of independent interest.