Alexey Maevskiy

Huawei Technologies (United Kingdom)

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Mikhail Kamenev

Huawei Technologies (China)

Oleg Kurmaev

Moscow State Institute of Electronics and Mathematics

Yulia Kameneva

Grigory Kabatiansky

Skolkovo Institute of Science and Technology

Vladimir Gritsenko

Huawei Technologies (United Kingdom)

V. V. Gritsenko

Don State Technical University

АЭ

Алексей Эдуардович Маевский

Southern Federal University

V. A. Gritsenko

Institute of Semiconductor Physics

Yu. S. Kameneva

Mining Institute

Hejia Luo

Huawei Technologies (China)

Cooperative Institutions

Huawei Technologies (China)

Huawei Technologies (United Kingdom)

Institute for Information Transmission Problems

Russian Academy of Sciences

Zhejiang University

National Research University Higher School of Economics

Tsinghua University

Ministry of Industry and Information Technology

University of Electronic Science and Technology of China

Southern Federal University

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

p(x)-Circulants over finite fields and probability methods of their construction

Mathematical Notes (2014)

V. V. Gritsenko Alexey Maevskiy

Value (mathematics)

Minification

10.1134/s0001434614110303

Cite

Citations (0)

Permutation Decoding of Polar Codes

Mikhail Kamenev Yulia Kameneva Oleg Kurmaev Alexey Maevskiy

A new permutation decoding approach for polar codes is presented. The proposed decoder can be used to achieve the error correction performance of a successive cancellation list (SCL) decoder, while it can either improve latency of the SCL decoder or decrease its hardware complexity. As opposed to the SCL algorithm, the proposed permutation algorithm can be implemented without sorting operation. It is shown that the error correction performance of the algorithm is similar to that of the SCL decoder for polar codes. Moreover, a new construction aiming to improve the error correction performance of polar codes under the proposed algorithm is presented.

List decoding

Sorting network

10.1109/redundancy48165.2019.9003333

Cite

Citations (33)

A New Permutation Decoding Method for Reed-Muller Codes

2022 IEEE International Symposium on Information Theory (ISIT) (2019)

Mikhail Kamenev Yulia Kameneva Oleg Kurmaev Alexey Maevskiy

A novel permutation decoding method for Reed-Muller codes is presented. The complexity and the error correction performance of the suggested permutation decoding approach are similar to that of the recursive lists decoder. It is demonstrated that the proposed decoding technique can take advantage of several early termination methods leading to a significant reduction of the operations number required for the decoding, with the error correction performance being the same.

List decoding

Berlekamp–Welch algorithm

10.1109/isit.2019.8849320

Cite

Citations (23)

Permutation Decoding of Polar Codes

arXiv (Cornell University) (2019)

Mikhail Kamenev Yu. S. Kameneva Oleg Kurmaev Alexey Maevskiy

A new permutation decoding approach for polar codes is presented. The complexity of the algorithm is similar to that of a successive cancellation list (SCL) decoder, while it can be implemented with the latency of a successive cancellation decoder. As opposed to the SCL algorithm, the sorting operation is not used in the proposed method. It is shown that the error correction performance of the algorithm is similar to that of the SCL decoder for polar codes. Moreover, a new construction aiming to improve the error correction performance of polar codes under the proposed algorithm is presented.

List decoding

10.48550/arxiv.1901.05459

Cite

Citations (0)

Алгоритм вычисления корней многочленов с коэффициентами из кольца многочленов над произвольной областью целостности

Математические заметки (2009)

Алексей Эдуардович Маевский Alexey Maevskiy

10.4213/mzm4034

Cite

Citations (0)

Analysis and Application of Permuted Polar Codes

2015 IEEE Global Communications Conference (GLOBECOM) (2018)

Hejia Luo Gongzheng Zhang Alexey Maevskiy Vladimir Gritsenko Yue Zhou

A special permutation group of polar codes based on $N$ /4-cyclic shift is designed and analyzed for practical use. A permutation-transformation equivalence is firstly introduced to transfer the effect of permutation on the codeword side to the uncoded side. Then, we introduce the $N$ /4-cyclic shift permutation and analyze the conditions under which it can permute a codeword to another for polar codes that even do not fully respect partial order. We also reveal that the value assignment of frozen bits should follow specific rules related to the permutation pattern. Finally, a novel polar-specific implicit indication method is presented by applying the $N$ /4-cyclic shift permutation group to the practical wireless communication scenarios such as Physical Broadcasting Channel (PBCH) of a cellular network, which significantly simplifies the detection algorithm.

Code (set theory)

10.1109/glocom.2018.8647725

Cite

Citations (5)

Permutation Decoding of Polar Codes

arXiv (Cornell University) (2019)

Mikhail Kamenev Yulia Kameneva Oleg Kurmaev Alexey Maevskiy

List decoding

Sorting network

Source

Cite

Citations (0)