Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have