List Decoding of Reed-Muller Codes Based on a Generalized Plotkin Construction

スポンサーリンク

概要

• 論文の詳細を見る

• Gopalan, Klivans, and Zuckerman proposed a list-decoding algorithm for Reed-Muller codes. Their algorithm works up to a given list-decoding radius. Dumer, Kabatiansky, and Tavernier improved the complexity of the algorithm for binary Reed-Muller codes by using the well-known Plotkin construction. In this study, we propose a list-decoding algorithm for non-binary Reed-Muller codes as a generalization of Dumer et al.'s algorithm. Our algorithm is based on a generalized Plotkin construction, and is more suitable for parallel computation than the algorithm of Gopalan et al. Since the list-decoding algorithms of Gopalan et al., Dumer et al., and ours can be applied to more general codes than Reed-Muller codes, we give a condition for codes under which these list-decoding algorithms works.

• The Institute of Electronics, Information and Communication Engineersの論文

著者

• YASUNAGA Kenji

  Faculty of Electrical and Computer Engineering, the Institute of Science and Engineering, Kanazawa University

関連論文

• List Decoding of Reed-Muller Codes Based on a Generalized Plotkin Construction

スポンサーリンク