BIDIRECTIONAL SEARCH DECODING OF REED-MULLER CODES
Reed-Muller码的双向搜索译码

A method which uses the bidirectional search to decode Reed-Muller codes is presented. It is proved to be a generalized minimum distance (GMD) algorithm. The complexity is much simpler than that of Forney's method. The computer simulation shows that the performance of this approach is almost the same as that of maximum likelihood decoding (MLD).