New Free Distance Bounds and Design Techniques for Joint Source-Channel Variable-Length Codes
Amadou Diallo, Claudio Weidmann, Michel Kieffer · IEEE Transactions on Communications · 2012
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.