Add to ORKGInternational audienceThe 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
We proposed in Jaspar et al. (2004) a joint source-channel (JSC) turbo-(de)coder combining a variabl...
In this paper we propose a novel Real-Valued Free Distance Metric (RV-FDM) for comparing the error c...
Variable length codes (VLCs), used in data compression, are very sensitive to error propagation in t...
International audienceThe class of variable-length finite-state joint source-channel codes is define...
International audienceThis paper considers the optimization of a class of joint source-channel codes...
International audienceThis paper proposes branch-and-prune algorithms for searching prefix-free join...
A class of codes called finite-state (FS) codes is defined and investigated. These codes, which gene...
International audienceThis paper addresses the design of joint source-channel variable-length codes ...
A class of codes called finite-state (FS) codes is defined and investigated. The codes, which genera...
Abstract. A discrete-time digital channel coding, in which the encoder and decoder are both time-inv...
Joint source-channel codes are codes simultaneously providing data compression and protection of the...
International audienceThis paper considers the optimization of Error- Correcting Variable-Length Cod...
In this paper we propose a novel Irregular Variable Length Coding (IrVLC) scheme for near-capacity j...
We proposed in Jaspar et al. (2004) a joint source-channel (JSC) turbo-(de)coder combining a variabl...
In this paper we propose a novel Real-Valued Free Distance Metric (RV-FDM) for comparing the error c...
Variable length codes (VLCs), used in data compression, are very sensitive to error propagation in t...
International audienceThe class of variable-length finite-state joint source-channel codes is define...
International audienceThis paper considers the optimization of a class of joint source-channel codes...
International audienceThis paper proposes branch-and-prune algorithms for searching prefix-free join...
A class of codes called finite-state (FS) codes is defined and investigated. These codes, which gene...
International audienceThis paper addresses the design of joint source-channel variable-length codes ...
A class of codes called finite-state (FS) codes is defined and investigated. The codes, which genera...
Abstract. A discrete-time digital channel coding, in which the encoder and decoder are both time-inv...
Joint source-channel codes are codes simultaneously providing data compression and protection of the...
International audienceThis paper considers the optimization of Error- Correcting Variable-Length Cod...
In this paper we propose a novel Irregular Variable Length Coding (IrVLC) scheme for near-capacity j...
We proposed in Jaspar et al. (2004) a joint source-channel (JSC) turbo-(de)coder combining a variabl...
In this paper we propose a novel Real-Valued Free Distance Metric (RV-FDM) for comparing the error c...
Variable length codes (VLCs), used in data compression, are very sensitive to error propagation in t...