Marion Jeanne

dblp:55/6743 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory
channel coding
0.112005
Joint source-channel decoding of variable-length codes for convolutional codes and turbo codes · IEEE Trans. Commun. 2005
Coding theory › error-correcting codes
convolutional codes
0.112005
Joint source-channel decoding of variable-length codes for convolutional codes and turbo codes · IEEE Trans. Commun. 2005
Coding theory › error-correcting codes › decoding › decoding algorithms
joint source-channel decoding
0.112005
Joint source-channel decoding of variable-length codes for convolutional codes and turbo codes · IEEE Trans. Commun. 2005
Coding theory
source coding
0.112005
Joint source-channel decoding of variable-length codes for convolutional codes and turbo codes · IEEE Trans. Commun. 2005
Coding theory › channel coding
turbo codes
0.112005
Joint source-channel decoding of variable-length codes for convolutional codes and turbo codes · IEEE Trans. Commun. 2005
Coding theory › source coding
variable-length codes
0.112005
Joint source-channel decoding of variable-length codes for convolutional codes and turbo codes · IEEE Trans. Commun. 2005

Methods — techniques the papers use, named apart from their topics

viterbi decoding · 0.1turbo decoding · 0.1huffman coding · 0.1
YearPublicationVenuePosition
2005 Joint source-channel decoding of variable-length codes for convolutional codes and turbo codes
abstract
Several recent publications have shown that joint source-channel decoding could be a powerful technique to take advantage of residual source redundancy for fixed- and variable-length source codes. This letter gives an in-depth analysis of a low-complexity method recently proposed by Guivarch et al., where the redundancy left by a Huffman encoder is used at a bit level in the channel decoder to improve its performance. Several simulation results are presented, showing for two first-order Markov sources of different sizes that using a priori knowledge of the source statistics yields a significant improvement, either with a Viterbi channel decoder or with a turbo decoder.
Marion Jeanne, Jean-Claude Carlach, Pierre Siohan
IEEE Trans. Commun.1
2002 Source and joint source-channel decoding of variable length codes
abstract
Several publications have shown that joint source-channel decoding (JSCD) could be a powerful technique for taking advantage of residual source redundancy. Furthermore, it appeared that the principle could also be successfully applied to variable length codes (VLCs). This paper gives an in-depth analysis of a new method proposed by Guivarch, Carlach and Siohan (see Data Compression Conference (DCC), Snowbird, Utah, USA, Mar. 2000, p.83-92) and Guivarch, Siohan and Carlach (see International Communication Conference (ICT), Acapulco, Mexico, May 2000, p.872-76) to provide a low complexity soft decoding of VLCs with and without channel coding. Furthermore we also present new results obtained in a video coding context, using a VLC table from the MPEG4 video standard. Compared to separated decoding systems, the gain in signal to noise ratio varies from 0.3 dB up to 2 dB.
Marion Jeanne, Jean-Claude Carlach, Pierre Siohan, Lionel Guivarch
ICC1