Add to ORKGInternational audienceThis paper considers the optimization of Error- Correcting Variable-Length Codes (EC-VLC), which are a class of joint-source channel codes. The aim is to find a prefix-free codebook with the largest possible free distance for a given set of codeword lengths, ℓ = (ℓ1, ℓ2, . . . , ℓM). The proposed approach consists in ordering all possible codebooks associated to ℓ on a tree, and then to apply an efficient branch-and-prune algorithm to find a codebook with maximal free distance. Three methods for building the tree of codebooks are presented and their efficiency is compared
[[abstract]]Variable length codes (VLCs) are widely adopted in many compression standards due to the...
[[abstract]]When we consider convolutional coded CPFSK over fading channels, the primary design crit...
We devise an analytically simple as well as invertible approximate expression, which describes the r...
International audienceThis paper considers the optimization of Error- Correcting Variable-Length Cod...
International audienceThis paper proposes branch-and-prune algorithms for searching prefix-free join...
International audienceThis paper addresses the design of joint source-channel variable-length codes ...
Abstract—A joint source-channel coding problem that com-bines the efficient compression of discrete ...
International audienceThis paper considers the optimization of a class of joint source-channel codes...
We propose a generic algorithm for the construction of efficient reversible variable-length codes (R...
In this paper we propose a novel Real-Valued Free Distance Metric (RV-FDM) for comparing the error c...
In this paper we demonstrate that our ability to match the EXtrinsic Information Transfer (EXIT) fun...
Joint source-channel codes are codes simultaneously providing data compression and protection of the...
The class of error-correcting convolutional codes is commonly used for reliable data transmission in...
International audienceThe class of variable-length finite-state joint source-channel codes is define...
Variable length codes (VLCs), used in data compression, are very sensitive to error propagation in t...
[[abstract]]Variable length codes (VLCs) are widely adopted in many compression standards due to the...
[[abstract]]When we consider convolutional coded CPFSK over fading channels, the primary design crit...
We devise an analytically simple as well as invertible approximate expression, which describes the r...
International audienceThis paper considers the optimization of Error- Correcting Variable-Length Cod...
International audienceThis paper proposes branch-and-prune algorithms for searching prefix-free join...
International audienceThis paper addresses the design of joint source-channel variable-length codes ...
Abstract—A joint source-channel coding problem that com-bines the efficient compression of discrete ...
International audienceThis paper considers the optimization of a class of joint source-channel codes...
We propose a generic algorithm for the construction of efficient reversible variable-length codes (R...
In this paper we propose a novel Real-Valued Free Distance Metric (RV-FDM) for comparing the error c...
In this paper we demonstrate that our ability to match the EXtrinsic Information Transfer (EXIT) fun...
Joint source-channel codes are codes simultaneously providing data compression and protection of the...
The class of error-correcting convolutional codes is commonly used for reliable data transmission in...
International audienceThe class of variable-length finite-state joint source-channel codes is define...
Variable length codes (VLCs), used in data compression, are very sensitive to error propagation in t...
[[abstract]]Variable length codes (VLCs) are widely adopted in many compression standards due to the...
[[abstract]]When we consider convolutional coded CPFSK over fading channels, the primary design crit...
We devise an analytically simple as well as invertible approximate expression, which describes the r...