A MILP approach for designing robust variable-length codes based on exact free distance computation

  • Hassan Hijazi
  • , Amadou Diallo
  • , Michel Kieffer
  • , Leo Liberti
  • , Claudio Weidmann

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper addresses the design of joint source-channel variable-length codes with maximal free distance for given codeword lengths. While previous design methods are mainly based on bounds on the free distance of the code, the proposed algorithm exploits an exact characterization of the free distance. The code optimization is cast in the framework of mixed-integer linear programming and allows to tackle practical alphabet sizes in reasonable computing time.

Original languageEnglish
Title of host publicationProceedings - DCC 2012
Subtitle of host publication2012 Data Compression Conference
Pages257-266
Number of pages10
DOIs
Publication statusPublished - 24 May 2012
Event2012 Data Compression Conference, DCC 2012 - Snowbird, UT, United States
Duration: 10 Apr 201212 Apr 2012

Publication series

NameData Compression Conference Proceedings
ISSN (Print)1068-0314

Conference

Conference2012 Data Compression Conference, DCC 2012
Country/TerritoryUnited States
CitySnowbird, UT
Period10/04/1212/04/12

Keywords

  • error correcting codes
  • joint source-channel variable-length codes
  • mixed-integer linear programming

Fingerprint

Dive into the research topics of 'A MILP approach for designing robust variable-length codes based on exact free distance computation'. Together they form a unique fingerprint.

Cite this