Zobrazeno 1 - 6
of 6
pro vyhledávání: '"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. A
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a456a8bb5ddc8a03aa304a016128306f
Publikováno v:
ISIT
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a6dd5b9f3e8ab5149699cf5c47c560f2
Publikováno v:
Designs, Codes and Cryptography. 82:293-299
We prove new lower bounds on the rate of codes for noisy multiple access adder channel and discuss its application to the well-known coin weighing problem in the case when some measurements are incorrect.
Autor:
Rong Li, Zhang Gongzheng, Alexey Maevskiy, Wang Jian, Chen Ying, Zhou Yue, Ge Yiqun, Luo Hejia, Gritsenko Vladimir, Jun Wang
Publikováno v:
GLOBECOM
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 uncod
Autor:
Alexey Maevskiy, Gritsenko Vladimir
Publikováno v:
Matematicheskie Zametki. 96:864-879
Autor:
Alexey Maevskiy
Publikováno v:
Matematicheskie Zametki. 85:73-88