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

Mikhail Chernikov

dblp:427/0949 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2026
0009-0005-7131-4343ORCID · corroborated

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

Computer networks · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

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

TopicWeightPapersLastEvidence papers
Coding theory
channel coding
1.012026
Design of Polar Subcodes for Permutation Decoding · IEEE Trans. Commun. 2026
Coding theory › channel coding
polar codes
1.012026
Design of Polar Subcodes for Permutation Decoding · IEEE Trans. Commun. 2026
Coding theory › error-correcting codes › code construction › code modification
polar subcodes
1.012026
Design of Polar Subcodes for Permutation Decoding · IEEE Trans. Commun. 2026
Coding theory › error-correcting codes › decoding › decoding algorithms › decoding of block codes
permutation decoding
0.312026
Design of Polar Subcodes for Permutation Decoding · IEEE Trans. Commun. 2026

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

successive cancellation · 1.0frozen set construction · 1.0
YearPublicationVenuePosition
2026 Simplified Successive Cancellation List Decoding of ABS+ Polar Codes
Mikhail Chernikov, Peter Trifonov
ISIT1
2026 Design of Polar Subcodes for Permutation Decoding
abstract
novel construction of randomized polar subcodes and subcodes of extended BCH codes is presented. The proposed approach stems from a new heuristic for building polar code frozen set which minimizes the error probability of successive cancellation algorithm applied to permuted noisy codewords. The frame error rate (FER) of the proposed codes under permutationbased decoding is comparable to FER of existing polar subcodes under successive cancellation list or sequential algorithm.
Mikhail Chernikov, Peter Trifonov
IEEE Trans. Commun.1