IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v13y2017i2p1550147716683406.html
   My bibliography  Save this article

A hybrid decoding of Reed–Muller codes

Author

Listed:
  • Shuang Li
  • Shicheng Zhang
  • Zhenxing Chen
  • Seog Geun Kang

Abstract

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.

Suggested Citation

  • Shuang Li & Shicheng Zhang & Zhenxing Chen & Seog Geun Kang, 2017. "A hybrid decoding of Reed–Muller codes," International Journal of Distributed Sensor Networks, , vol. 13(2), pages 15501477166, February.
    • Handle: RePEc:sae:intdis:v:13:y:2017:i:2:p:1550147716683406
    DOI: 10.1177/1550147716683406
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147716683406
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1550147716683406?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:13:y:2017:i:2:p:1550147716683406. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.