English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A novel permuted fast successive-cancellation list decoding algorithm withfast Hadamard transform (FHT-FSCL) is presented. The proposed decoderinitializes $L$ $(L\ge1)$ active decoding paths with $L$ random codewordpermutations sampled from the full symmetry group of the codes. The pathextension in the permutation domain is carried out until the first constituentRM code of order $1$ is visited. Conventional path extension of thesuccessive-cancellation list decoder is then utilized in the information bitdomain. The simulation results show that for a RM code of length $512$ with$46$ information bits, by running $20$ parallel permuted FHT-FSCL decoders with$L=4$, we reduce $72\%$ of the computational complexity, $22\%$ of the decodinglatency, and $84\%$ of the memory consumption of the state-of-the-artsimplified successive-cancellation decoder that uses $512$ permutations sampledfrom the full symmetry group of the code, with similar error-correctionperformance at the target frame error rate of $10^{-4}$.

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