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

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.
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal-supelec.archives-ouvertes.fr/hal-00727773
Contributor : Michel Kieffer <>
Submitted on : Tuesday, September 4, 2012 - 1:06:26 PM
Last modification on : Thursday, October 17, 2019 - 12:36:55 PM
Long-term archiving on : Wednesday, December 5, 2012 - 10:13:16 AM

File

DialloTCOM11_draft.pdf
Files produced by the author(s)

Identifiers

Citation

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

Share

Metrics

Record views

675

Files downloads

323