New Free Distance Bounds and Design Techniques for Joint Source-Channel Variable-Length Codes

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

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

This paper proposes branch-and-prune algorithms for searching prefix-free joint source-channel codebooks with maximal free distance for given codeword lengths. For that purpose, it introduces improved techniques to bound the free distance of variable-length codes.

Domaines: Théorie de l'information [cs.IT]; Théorie de l'information et codage [math.IT]

Amadou Diallo, Claudio Weidmann, Michel Kieffer. New Free Distance Bounds and Design Techniques for Joint Source-Channel Variable-Length Codes. IEEE Transactions on Communications, 2012, 60 (10), pp.3080-3090. ⟨10.1109/TCOMM.2012.072412.110706⟩. ⟨hal-00727773⟩