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.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00549232
Contributor : Michel Kieffer <>
Submitted on : Tuesday, December 21, 2010 - 3:04:57 PM
Last modification on : Wednesday, February 20, 2019 - 2:38:28 PM
Document(s) archivé(s) le : Tuesday, March 22, 2011 - 3:02:53 AM

Identifiers

  • 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. ⟨hal-00549232⟩

Share

Metrics

Record views

421

Files downloads

258