An Iterative Bit-Flipping Decoding Algorithm for Binary Reed-Muller Codes ∗

Yong Ting Ni, Cheng Yu Pai, Chao Yu Chen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper presents an iterative bit-flipping (BF) decoding algorithm for binary Reed-Muller (RM) codes. The BF decoding algorithm is a hard-decision decoding algorithm. According to the updated hard reliability measures, one bit of the received hard-decision sequence is flipped at a time ineach iteration. The simulation results show that the proposed BF decoding algorithm outperforms theconventional hard-decision majority decoding.

Original languageEnglish
Title of host publicationProceedings of 2020 International Symposium on Information Theory and its Applications, ISITA 2020
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages190-194
Number of pages5
ISBN (Electronic)9784885523304
Publication statusPublished - 2020 Oct 24
Event16th International Symposium on Information Theory and its Applications, ISITA 2020 - Virtual, Kapolei, United States
Duration: 2020 Oct 242020 Oct 27

Publication series

NameProceedings of 2020 International Symposium on Information Theory and its Applications, ISITA 2020

Conference

Conference16th International Symposium on Information Theory and its Applications, ISITA 2020
Country/TerritoryUnited States
CityVirtual, Kapolei
Period20-10-2420-10-27

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Information Systems
  • Software
  • Theoretical Computer Science

Fingerprint

Dive into the research topics of 'An Iterative Bit-Flipping Decoding Algorithm for Binary Reed-Muller Codes ∗'. Together they form a unique fingerprint.

Cite this