@inproceedings{1b6035f34372441faf15f52c37c89d34,
title = "On computation of performance bounds of optimal index assignment",
abstract = "Channel-optimized index assignment of source codewords is arguably the simplest way of improving transmission error resilience, while keeping the source and/or channel codes intact. But optimal design of index assignment is an in-stance of quadratic assignment problem (QAP), one of the hardest optimization problems in the NP-complete class. In this paper we make a progress in the research of index assignment optimization. We apply some recent results of QAP research to compute the strongest lower bounds so far for channel distor-tion of BSC among all index assignments. The strength of the resulting lower bounds is validated by comparing them against the upper bounds produced by heuristic index assignment algorithms.",
keywords = "Error resilience, Index assignment, Quadratic assignment, Quantization, Relaxation, Semidefinite programming",
author = "Xiaolin Wu and Hans Mittelmann and Xiaohan Wang and Jia Wang",
note = "Copyright: Copyright 2010 Elsevier B.V., All rights reserved.; Data Compression Conference, DCC 2010 ; Conference date: 24-03-2010 Through 26-03-2010",
year = "2010",
doi = "10.1109/DCC.2010.24",
language = "English (US)",
isbn = "9780769539942",
series = "Data Compression Conference Proceedings",
pages = "189--198",
booktitle = "Proceedings - Data Compression Conference, DCC 2010",
}