On computation of performance bounds of optimal index assignment

Xiaolin Wu, Hans Mittelmann, Xiaohan Wang, Jia Wang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations


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.

Original languageEnglish (US)
Title of host publicationProceedings - Data Compression Conference, DCC 2010
Number of pages10
StatePublished - 2010
EventData Compression Conference, DCC 2010 - Snowbird, UT, United States
Duration: Mar 24 2010Mar 26 2010

Publication series

NameData Compression Conference Proceedings
ISSN (Print)1068-0314


OtherData Compression Conference, DCC 2010
Country/TerritoryUnited States
CitySnowbird, UT


  • Error resilience
  • Index assignment
  • Quadratic assignment
  • Quantization
  • Relaxation
  • Semidefinite programming

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this