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

Mars Davletshin

dblp:247/5914 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2020
0000-0003-3821-8331ORCID · reported

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

Computer networks · 1

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 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory
error-correcting codes
0.412020
Weight Distributions for Successive Cancellation Decoding of Polar Codes · IEEE Trans. Commun. 2020
Coding theory › channel coding
polar codes
0.412020
Weight Distributions for Successive Cancellation Decoding of Polar Codes · IEEE Trans. Commun. 2020
Coding theory › channel coding › polar codes
successive cancellation decoding
0.412020
Weight Distributions for Successive Cancellation Decoding of Polar Codes · IEEE Trans. Commun. 2020
Coding theory › error-correcting codes
weight distribution
0.412020
Weight Distributions for Successive Cancellation Decoding of Polar Codes · IEEE Trans. Commun. 2020
Coding theory › error-correcting codes › error probability analysis
decoding error probability
0.112020
Weight Distributions for Successive Cancellation Decoding of Polar Codes · IEEE Trans. Commun. 2020

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

weight distribution analysis · 0.4coset distance analysis · 0.4
YearPublicationVenuePosition
2020 Weight Distributions for Successive Cancellation Decoding of Polar Codes
abstract
In this paper, we derive the exact weight distributions that emerge during each stage of successive cancellation decoding of polar codes. Though we do not compute the distance spectrum of polar codes, the results allow us to get an estimate of the decoding error probability and to show a link between the first nonzero components of the weight distribution and the partial order between the synthetic channels. Also, we establish the minimal distance between two cosets associated with two paths that differ in two positions. This can be regarded as a first step toward analyzing the weight distributions for successive cancellation list decoding.
Rina Polyanskaya, Mars Davletshin, Nikita Polyanskii
IEEE Trans. Commun.2