Optimizing the Free Distance of Error-Correcting Variable-Length Codes

Amadou Diallo (1) , Claudio Weidmann (2) , Michel Kieffer (1, 3)

1 LTCI - Laboratoire Traitement et Communication de l'Information
2 ETIS - UMR 8051 - Equipes Traitement de l'Information et Systèmes
3 L2S - Laboratoire des signaux et systèmes

This paper considers the optimization of Error- Correcting Variable-Length Codes (EC-VLC), which are a class of joint-source channel codes. The aim is to find a prefix-free codebook with the largest possible free distance for a given set of codeword lengths, ℓ = (ℓ1, ℓ2, . . . , ℓM). The proposed approach consists in ordering all possible codebooks associated to ℓ on a tree, and then to apply an efficient branch-and-prune algorithm to find a codebook with maximal free distance. Three methods for building the tree of codebooks are presented and their efficiency is compared.

Domaines: Traitement du signal et de l'image [eess.SP]; Réseaux et télécommunications [cs.NI]; Traitement du signal et de l'image [eess.SP]

Amadou Diallo, Claudio Weidmann, Michel Kieffer. Optimizing the Free Distance of Error-Correcting Variable-Length Codes. International Workshop on Multimedia Signal Processing, Oct 2010, Saint Malo, France. pp.4. ⟨hal-00549232⟩