Title :
New Free Distance Bounds and Design Techniques for Joint Source-Channel Variable-Length Codes
Author :
Diallo, Amadou ; Weidmann, Claudio ; Kieffer, Michel
Author_Institution :
L2S, Univ. Paris-Sud, Orsay, France
fDate :
10/1/2012 12:00:00 AM
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.
Keywords :
combined source-channel coding; search problems; variable length codes; branch-and-prune algorithm; codeword length; design technique; free distance bound; joint source-channel variable-length code; maximal free distance; prefix-free joint source-channel codebook searching; Complexity theory; Hamming distance; Joints; Manganese; Redundancy; Upper bound; Vectors; Variable-length codes; channel codes; finite state machines; joint source-channel codes; source codes;
Journal_Title :
Communications, IEEE Transactions on
DOI :
10.1109/TCOMM.2012.072412.110706
