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, l = (l 1 , l 2 , …, l M ). The proposed approach consists in ordering all possible codebooks associated to l 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have