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

doi:10.1109/DCC.2012.33

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

Hassan Hijazi ^{1, 2} Amadou Diallo ² Michel Kieffer ^{2, 3} Leo Liberti ¹ Claudio Weidmann ⁴

1 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]

2 L2S - Laboratoire des signaux et systèmes

3 LTCI - Laboratoire Traitement et Communication de l'Information

4 ETIS - Equipes Traitement de l'Information et Systèmes

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.

Document type :

Conference papers

Domain :

Computer Science [cs] / Information Theory [cs.IT]

Mathematics [math] / Information Theory [math.IT]

Liste complète des métadonnées

Cited literature [16 references] Display Hide Download

https://hal-supelec.archives-ouvertes.fr/hal-00727540
Contributor : Michel Kieffer <>
Submitted on : Monday, September 3, 2012 - 6:17:53 PM
Last modification on : Wednesday, March 27, 2019 - 4:41:27 PM
Document(s) archivé(s) le : Tuesday, December 4, 2012 - 3:42:30 AM

VLC_PG_v11.pdf

Files produced by the author(s)

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

File

Identifiers

Collections

Citation

Export

Metrics

1039

143

Contact

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

File

Identifiers

Collections

Citation

Export

Share

Metrics

1039

143

Contact