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

2024 year

Karakchieva L., Trifonov P.

A Recursive Soft-Input Soft-Output Decoding Algorithm // IEEE Transactions on Communications - 2024, Vol. 72, No. 3, pp. 1290-1302
Trofimiuk G.

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

2023 year

Karakchieva L., Trifonov P.

Design of non-binary polar codes with shaping // 2023 XVIII International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY) - 2023, pp. 178-182
Trifonov P.V.

Design and Decoding of Polar Codes with Large Kernels: A Survey // Problems of Information Transmission - 2023, Vol. 59, No. 1, pp. 22-40
Trifonov P., Karakchieva L.

Recursive Processing Algorithm for Low Complexity Decoding of Polar Codes with Large Kernels // IEEE Transactions on Communications - 2023, Vol. 71, No. 9, pp. 5039–5050
Трифонов П.В.

Построение и декодирование полярных кодов с большими ядрами: обзор // Проблемы передачи информации - 2023. - Т. 59. - № 1. - С. 25-45

Research Areas Areas

Polar subcodes

Sequential decoding of polar codes

Polar codes with large kernels

Last publications Publications

Karakchieva L., Trifonov P.

Trofimiuk G.

Karakchieva L., Trifonov P.

Trifonov P.V.

Trifonov P., Karakchieva L.

Трифонов П.В.