Evaluation of the distance spectrum of variable-length finite-state codes

The class of variable-length finite-state joint source-channel codes is defined and a polynomial complexity algorithm for the evaluation of their distance spectrum presented. Issues in truncating the spectrum to a finite number of (possibly approximate) terms are discussed and illustrated by experimental results.

• Type: Journal
• Year: 2010
• Where: TCOM
• Authors: Claudio Weidmann, Michel Kieffer
• Keywords: Distance Spectrum, Finite-state Joint Source-channel, Polynomial Complexity Algorithm, Software Engineering, TCOM 2010