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

Hassan Hijazi 1, 2 Amadou Diallo 2 Michel Kieffer 2, 3 Leo Liberti 1 Claudio Weidmann 4
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
Complete list of metadatas

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 : Thursday, October 17, 2019 - 12:36:54 PM
Long-term archiving on : Tuesday, December 4, 2012 - 3:42:30 AM

File

VLC_PG_v11.pdf
Files produced by the author(s)

Identifiers

Collections

CNRS | UNIV-CERGY | LIX | INSMI | X | X-LIX | SUPELEC | SUP_LSS | SUP_TELECOMS | L2S | ETIS-ICI | ETIS | INSTITUT-TELECOM | PARISTECH | X-DEP-INFO | LTCI

Citation

Hassan Hijazi, Amadou Diallo, Michel Kieffer, Leo Liberti, Claudio Weidmann. A MILP approach for designing robust variable-length codes based on exact free distance computation. DCC 2012, Apr 2012, Snowbird, United States. pp.257 - 266, ⟨10.1109/DCC.2012.33⟩. ⟨hal-00727540⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

1122

Files downloads

241

Contact

CCSD