Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Fangping Ye

dblp:225/5291 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2019
0000-0002-1700-5073ORCID · reported

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

Computer networks · 1 · 1 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 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory
error-correcting codes
0.412019
Optimized Rate-Adaptive Protograph-Based LDPC Codes for Source Coding With Side Information · IEEE Trans. Commun. 2019
Coding theory › error-correcting codes
LDPC codes
0.412019
Optimized Rate-Adaptive Protograph-Based LDPC Codes for Source Coding With Side Information · IEEE Trans. Commun. 2019
Coding theory › error-correcting codes › LDPC codes
protograph LDPC codes
0.412019
Optimized Rate-Adaptive Protograph-Based LDPC Codes for Source Coding With Side Information · IEEE Trans. Commun. 2019
Coding theory › source coding › multiterminal source coding › distributed source coding
slepian-wolf coding
0.412019
Optimized Rate-Adaptive Protograph-Based LDPC Codes for Source Coding With Side Information · IEEE Trans. Commun. 2019
Coding theory
source coding
0.412019
Optimized Rate-Adaptive Protograph-Based LDPC Codes for Source Coding With Side Information · IEEE Trans. Commun. 2019

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

density evolution · 0.4code degree distribution optimization · 0.4
YearPublicationVenuePosition
2019 Optimized Rate-Adaptive Protograph-Based LDPC Codes for Source Coding With Side Information
abstract
This paper considers the problem of source coding with side information at the decoder, also called Slepian-Wolf source coding scheme. In practical applications of this coding scheme, the statistical relation between the source and the side information can vary from one data transmission to another, and there is a need to adapt the coding rate depending on the current statistical relation. In this paper, we propose a novel rate-adaptive code construction based on LDPC codes for the Slepian-Wolf source coding scheme. The proposed code design method allows to optimize the code degree distributions at all the considered rates, while minimizing the amount of short cycles in the parity check matrices at all rates. Simulation results show that the proposed method greatly reduces the source coding rate compared to the standard low density parity check accumulated (LDPCA) solution.
Fangping Ye, Elsa Dupraz, Zeina Mheich, Karine Amis
IEEE Trans. Commun.1