Research Areas Areas

Polar subcodes

A generalization of polar codes was suggested, known as polar subcodes or polar codes with dynamic frozen symbols. These codes have better distance properties and provide better performance compared to classical polar codes. Their decoding can be implemented using any decoding algorithm suggested for classical polar codes.

Sequential decoding of polar codes

A generalization of the sequential decoding algorithm to the caae of polar codes was suggested. The proposed algorithm provides performance close to that of list decoding with much lower average complexity. Polar subcodes under sequential decoding provide both better performance and lower decoding complexity compared to LDPC codes.

Polar codes with large kernels

New techniques for construction of polar (sub)codes with large kernels were suggested: Methods for assessing the reliability of bit subchannels of the polarizing transformation, which allow one to select the indices of frozen symbols. Constructions of polar subcodes with large kernels with improved distance properties compared to classical polar codes. Methods for constructions of large polarization kernels, including kernels with the record rate of polarization and length-compatible kernels. New decoding methods for polar (sub)codes with large kernels were proposed: Kernel processing algorithms, which compute the log-likelihood ratios for kernel input symbols, as required by the successive cancellation decoding method. Window and recursive trellis methods were suggested, which have the lowest complexity among the presently known approaches. A sequential decoding algorithm for polar codes with large kernels. Joint application of the proposed construction and decoding methods for polar subcodes with large kernels allows one to obtain both better performance and lower decoding complexity compard to similar codes with Arikan kernel.

All publications

Last publications Publications

2026 year

Chernikov M., Trifonov P.

Design of Polar Subcodes for Permutation Decoding // IEEE Transactions on Communications - 2026, Vol. 74, pp. 8300-8311. doi: 10.1109/TCOMM.2026.3686689
Kochemazov S., Заикин О.С., Trofimiuk G., Antonov K., Semenov A.

Using Constraint Solvers to Construct Binary Codes with Good Error Correction Performance // The 40th Annual AAAI Conference on Artificial Intelligence - 2026

2025 year

Ashikhmin A., Trifonov P.

Fast Successive Cancellation Decoding of Polar Codes with Large Kernels // IEEE Transactions on Communications - 2025, Vol. 73, No. 1, pp. 3-11. doi: 10.1109/TCOMM.2024.3420740
Vorontsova I., Goncharov R., Filipov I., Chistiakov V., Nasedkin B., Trifonov P., Gellert M., Goncharov F., Tupyakov D., Samsonov E., Egorov V.

Composable security analysis of an experimental continuous-variable quantum key distribution system operating with polar codes // Journal of the Optical Society of America B - 2025, Vol. 42, No. 12, pp. 2883-2892. doi: 10.1364/JOSAB.573606

2024 year

Oreshin M., Trifonov P.

Polar Subcodes with Improved Weight Spectrum // 2024 IEEE International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON) - 2024, pp. 41-46. doi: 10.1109/SIBIRCON63777.2024.10758477
Trofimiuk G.

Fast Search Method for Large Polarization Kernels // IEEE Transactions on Communications - 2024, Vol. 72, No. 1, pp. 75-84. doi: 10.1109/TCOMM.2023.3324651

Research Areas Areas

Polar subcodes

Sequential decoding of polar codes

Polar codes with large kernels

Last publications Publications

Chernikov M., Trifonov P.

Kochemazov S., Заикин О.С., Trofimiuk G., Antonov K., Semenov A.

Ashikhmin A., Trifonov P.

Vorontsova I., Goncharov R., Filipov I., Chistiakov V., Nasedkin B., Trifonov P., Gellert M., Goncharov F., Tupyakov D., Samsonov E., Egorov V.

Oreshin M., Trifonov P.

Trofimiuk G.