Name
Abstract | ||
|---|---|---|
Reed–Muller (RM) codes are known for their good maximum likelihood (ML) performance in the short block-length regime. Despite being one of the oldest classes of channel codes, finding a low complexity soft-input decoding scheme is still an open problem. In this work, we present a versatile decoding architecture for RM codes based on their rich automorphism group. The decoding algorithm can be seen... |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/TCOMM.2021.3098798 | IEEE Transactions on Communications |
Keywords | DocType | Volume |
Maximum likelihood decoding,Polar codes,Iterative decoding,Belief propagation,Encoding,Complexity theory,Generators | Journal | 69 |
Issue | ISSN | Citations |
10 | 0090-6778 | 2 |
PageRank | References | Authors |
0.39 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marvin Geiselhart | 1 | 2 | 1.74 |
| Ahmed Elkelesh | 2 | 28 | 3.05 |
| Moustafa Ebada | 3 | 28 | 3.05 |
| sebastian cammerer | 4 | 157 | 16.76 |
| Stephan ten Brink | 5 | 2912 | 204.86 |