A hybrid decoding of Reed–Muller codes | Zendy

Shuang Li | Zendy; Shicheng Zhang | Zendy; Zhenxing Chen | Zendy; Seog Geun Kang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A hybrid decoding of Reed–Muller codes

Author(s) -

Shuang Li,

Shicheng Zhang,

Zhenxing Chen,

Seog Geun Kang

Publication year - 2017

Publication title -

international journal of distributed sensor networks

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.324

H-Index - 53

eISSN - 1550-1477

pISSN - 1550-1329

DOI - 10.1177/1550147716683406

Subject(s) - computer science , decoding methods , algorithm , hadamard transform , berlekamp–welch algorithm , code (set theory) , sequential decoding , list decoding , concatenated error correction code , block code , mathematics , mathematical analysis , set (abstract data type) , programming language

In this article, a hybrid decoding algorithm for Reed–Muller codes is presented. Unlike the conventional algorithm, the presented algorithm ends recursive decomposition when R(1,m) and R(m−1,m) appeared. A simplified maximum-likelihood algorithm based on fast Hadamard transform is also exploited to decode the systematic code through its special structure. As a result, the presented hybrid decoding algorithm reduces the number of floating-point multiplications significantly as compared with the conventional algorithms. In addition, the new algorithm has better error performance than the conventional ones.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research