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

Abstract : 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.
Type de document :
Communication dans un congrès
International Workshop on Multimedia Signal Processing, Oct 2010, Saint Malo, France. pp.4, 2010
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00549232
Contributeur : Michel Kieffer <>
Soumis le : mardi 21 décembre 2010 - 15:04:57
Dernière modification le : lundi 17 septembre 2018 - 10:04:06
Document(s) archivé(s) le : mardi 22 mars 2011 - 03:02:53

Identifiants

  • HAL Id : hal-00549232, version 1

Citation

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, 2010. 〈hal-00549232〉

Partager

Métriques

Consultations de la notice

404

Téléchargements de fichiers

250