activity
20042021
most citedRecursive constructions and their maximum likelihood decoding

11 citations · 23 across the 10 of their papers we have counts for

collaborators
Showing 2017Show all

7 papers · 1 filter

cs.IT20172 cited

On decoding algorithms for polar codes

Ilya Dumer

We survey the known list decoding algorithms for polar codes and compare their complexity. Index terms: Polar codes; Reed-Muller codes; successive cancellation decoding.

cs.IT2017

Recursive Decoding and Its Performance for Low-Rate Reed-Muller Codes

Ilya Dumer

Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length and fixed order An algorithm is designed that has complexity of order a…

cs.IT2017

Soft decision decoding of Reed-Muller codes: recursive lists

Ilya Dumer, Kirill Shabunov

Recursive list decoding is considered for Reed-Muller (RM) codes. The algorithm repeatedly relegates itself to the shorter RM codes by recalculating the posterior probabilities of…

cs.IT20172 cited

Recursive List Decoding for Reed-Muller Codes

Ilya Dumer, Kirill Shabunov

We consider recursive decoding for Reed-Muller (RM) codes and their subcodes. Two new recursive techniques are described. We analyze asymptotic properties of these algorithms and s…

cs.IT20174 cited

Recursive decoding of Reed-Muller codes

Ilya Dumer

New soft- and hard decision decoding algorithms are presented for general Reed-Muller codes of length and distance . We…

cs.IT201711 cited

Recursive constructions and their maximum likelihood decoding

Ilya Dumer, Kirill Shabunov

We consider recursive decoding techniques for RM codes, their subcodes, and newly designed codes. For moderate lengths up to 512, we obtain near-optimum decoding with feasible comp…