activity
20162022
most citedFast and Flexible Successive-Cancellation List Decoders for Polar Codes

222 citations · 366 across the 18 of their papers we have counts for

collaborators
Showing 2021Show all

5 papers · 1 filter

cs.IT2021

Successive Syndrome-Check Decoding of Polar Codes

Seyyed Ali Hashemi, Marco Mondelli, John Cioffi +1

A two-part successive syndrome-check decoding of polar codes is proposed with the first part successively refining the received codeword and the second part checking its syndrome.…

cs.IT2021★ 8 cited

Fast Successive-Cancellation List Flip Decoding of Polar Codes

Nghia Doan, Seyyed Ali Hashemi, Warren J. Gross

This work presents a fast successive-cancellation list flip (Fast-SCLF) decoding algorithm for polar codes that addresses the high latency issue associated with the successive-canc…

cs.IT2021

Decoding Reed-Muller Codes with Successive Codeword Permutations

Nghia Doan, Seyyed Ali Hashemi, Marco Mondelli +1

A novel recursive list decoding (RLD) algorithm for Reed-Muller (RM) codes based on successive permutations (SP) of the codeword is presented. A low-complexity SP scheme applied to…

cs.IT2021

Successive-Cancellation Decoding of Reed-Muller Codes with Fast Hadamard Transform

Nghia Doan, Seyyed Ali Hashemi, Warren J. Gross

A novel permuted fast successive-cancellation list decoding algorithm with fast Hadamard transform (FHT-FSCL) is presented. The proposed decoder initializes active de…

cs.IT2021

A Tree Search Approach for Maximum-Likelihood Decoding of Reed-Muller Codes

Seyyed Ali Hashemi, Nghia Doan, Warren J. Gross +2

A low-complexity tree search approach is presented that achieves the maximum-likelihood (ML) decoding performance of Reed-Muller (RM) codes. The proposed approach generates a bit-f…