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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Anatolii Ashikhmin

dblp:355/1436 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2026
0009-0009-5192-8822ORCID · reported

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

Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 2 since 2021Computer networks · 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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › channel coding › polar codes › polar code construction
large kernel polar codes		 0.912025
Fast Successive Cancellation Decoding of Polar Codes With Large Kernels · IEEE Trans. Commun. 2025
Coding theory › channel coding
polar codes		 0.912025
Fast Successive Cancellation Decoding of Polar Codes With Large Kernels · IEEE Trans. Commun. 2025
Coding theory › channel coding › polar codes
successive cancellation decoding		 0.912025
Fast Successive Cancellation Decoding of Polar Codes With Large Kernels · IEEE Trans. Commun. 2025

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

fast successive cancellation decoding · 0.9asymptotic latency analysis · 0.9
YearPublicationVenuePosition
2026 Large Kernel Construction Based on Generalized Polarization Transforms
Anatolii Ashikhmin, Peter Trifonov
 ISIT1
2025 Fast Successive Cancellation Decoding of Polar Codes With Large Kernels
abstract
A generalization of the fast successive cancellation decoding algorithm to the case of binary polar codes with arbitrary large kernels is presented. Its asymptotic latency is shown to be$O(N^{1-1/\mu })$, where$\mu $is the scaling exponent of the underlying polarization kernel.
Anatolii Ashikhmin, Peter Trifonov
 IEEE Trans. Commun.1
2023 Efficient Evaluation of Polarization Behavior for Large Kernels
abstract
A reduced complexity algorithm for computing polarization behavior of binary kernels is presented. It is based on the Yao-Fazeli-Vardy algorithm. The idea is to recompute linear manifolds, which represent trellis vertices, via those obtained at a previous trellis layer. It provides several times complexity reduction for many published kernels.
Anatolii Ashikhmin, Peter Trifonov
 ISIT1