BIDIRECTIONAL SEARCH DECODING OF REED-MULLER CODES

Li Hui; Wang Yumin

Volume 16 Issue 6

Nov. 1994

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 1994 > 16(6): 591-597

Li Hui, Wang Yumin. BIDIRECTIONAL SEARCH DECODING OF REED-MULLER CODES[J]. Journal of Electronics & Information Technology, 1994, 16(6): 591-597.

Citation:

Li Hui, Wang Yumin. BIDIRECTIONAL SEARCH DECODING OF REED-MULLER CODES[J]. Journal of Electronics & Information Technology, 1994, 16(6): 591-597.

Li Hui, Wang Yumin. BIDIRECTIONAL SEARCH DECODING OF REED-MULLER CODES[J]. Journal of Electronics & Information Technology, 1994, 16(6): 591-597.

Citation:

Li Hui, Wang Yumin. BIDIRECTIONAL SEARCH DECODING OF REED-MULLER CODES[J]. Journal of Electronics & Information Technology, 1994, 16(6): 591-597.

PDF( 1028 KB)

BIDIRECTIONAL SEARCH DECODING OF REED-MULLER CODES

Li Hui,
Wang Yumin

Received Date: 1993-05-31
Rev Recd Date: 1993-11-25
Publish Date: 1994-11-19

Abstract

Abstract

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).

FullText(HTML)

References(1)

References

Forney G D. IEEE Trans. on IT, 1988, IT-34(5):1152-1187.[2]段文清.Colay码的一种新的译码算法:[硕士论文].西安电子科技大学,1991.[3]MacWilliama F J, Sloane N J A. The Theory of Ertor Correcting Codet, Amtterdsm, Norch Holland: 1977, Ch. 13, 3.[4]Forney G D. IEEE Trans. on IT. 1966. IT-12(4):125-131.

Relative Articles

Supplements(0)

Cited By

Proportional views