4.7 Article

On Decoding of Reed-Muller Codes Using a Local Graph Search

Related references

Note: Only part of the references are listed.
Proceedings Paper Computer Science, Information Systems

Complexity-Adaptive Maximum-Likelihood Decoding of Modified GN-Coset Codes

Peihong Yuan et al.

Summary: The proposed complexity-adaptive tree search algorithm is suitable for G(N)-coset codes, achieving near-ML decoding without the need for an outer code to terminate decoding. It can be applied to various code constructions and does not require optimization of a separate parameter like sequential decoders do.

2021 IEEE INFORMATION THEORY WORKSHOP (ITW) (2021)

Article Computer Science, Information Systems

Recursive Projection-Aggregation Decoding of Reed-Muller Codes

Min Ye et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2020)

Proceedings Paper Computer Science, Theory & Methods

Pruning Neural Belief Propagation Decoders

Andreas Buchberger et al.

2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) (2020)

Proceedings Paper Computer Science, Information Systems

Permutation-based Decoding of Reed-Muller Codes in Binary Erasure Channel

Kirill Ivanov et al.

2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) (2019)

Article Computer Science, Information Systems

Reed-Muller Codes Achieve Capacity on Erasure Channels

Shrinivas Kudekar et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2017)

Article Computer Science, Information Systems

Soft-decision decoding of Reed-Muller codes: Recursive lists

I Dumer et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2006)