 |
|
 |
|
|
|
|
|
| HAL: hal-00549232, version 1 |
| Detailed view |  Export this paper |
|
|
| International Workshop on Multimedia Signal Processing, Saint Malo : France (2010) |
|
|
|
|
| Optimizing the Free Distance of Error-Correcting Variable-Length Codes |
|
|
| Amadou Diallo 1Claudio Weidmann 2 |
|
|
| (2010-10-04) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire Traitement et Communication de l'Information [Paris] (LTCI) |
|
|
|
Télécom ParisTech – CNRS : UMR5141 |
|
|
| 2: | Equipes Traitement de l'Information et Systèmes (ETIS) |
|
|
|
CNRS : UMR8051 – ENSEA – Université de Cergy Pontoise |
|
|
| 3: | Laboratoire des signaux et systèmes (L2S) |
|
|
|
UMR8506 CNRS – SUPELEC – Université Paris XI - Paris Sud |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Signal and Image Processing Computer Science/Networking and Telecommunication Engineering Sciences/Signal and Image processing |
|
|
| Attached file list to this document: | ||||||||||
|
||||||||||
|
|
|
| hal-00549232, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00549232 | |
| oai:hal.archives-ouvertes.fr:hal-00549232 | |
| From: Michel Kieffer | |
| Submitted on: Tuesday, 21 December 2010 15:04:57 | |
| Updated on: Tuesday, 21 December 2010 15:27:28 | |
