@inproceedings{38abc666c4954dbc9dffb877b83437b1,
title = "A Tree Search Approach for Maximum-Likelihood Decoding of Reed-Muller Codes",
abstract = "A low-complexity tree search approach is presented that is equivalent to the maximum-likelihood (ML) decoding of Reed-Muller (RM) codes. The proposed approach generates a bit-flipping tree that is traversed to find the ML decoding result by performing successive-cancellation decoding after each node visit. A depth-first search (DFS) and a breadth-first search (BFS) scheme are developed and a log-likelihood-ratio-based bit-flipping metric is utilized to avoid redundant node visits in the tree. Several enhancements to the proposed algorithm are presented to further reduce the number of node visits. Simulation results confirm that the BFS scheme provides a lower average number of node visits than the existing tree search approach to decode RM codes.",
author = "Hashemi, {Seyyed Ali} and Nghia Doan and Gross, {Warren J.} and John Cioffi and Andrea Goldsmith",
note = "Publisher Copyright: {\textcopyright} 2021 IEEE.; 2021 IEEE Globecom Workshops, GC Wkshps 2021 ; Conference date: 07-12-2021 Through 11-12-2021",
year = "2021",
doi = "10.1109/GCWkshps52748.2021.9682042",
language = "English (US)",
series = "2021 IEEE Globecom Workshops, GC Wkshps 2021 - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "2021 IEEE Globecom Workshops, GC Wkshps 2021 - Proceedings",
address = "United States",
}