Lee-metric decoding of BCH and Reed–Solomon codes
Xin-Wen Wu, Margreta Kuijper, P. Udaya
Abstract
Xin-Wen Wu, Margreta Kuijper, P. Udaya
Abstract
A Lee-metric list-decoding algorithm for Reed–Solomon (RS) codes over GF( p) is presented. The algorithm is obtained by generalising the Guruswami–Sudan (Hamming metric) list-decoding algorithm for RS codes. The algorithm can be used to decode the Lee-metric BCH codes, and outperforms the known Lee-metric decoding algorithm for BCH codes.
OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A Lee-metric list-decoding algorithm for Reed–Solomon (RS) codes over GF( p) is presented. The algorithm is obtained by generalising the Guruswami–Sudan (Hamming metric) list-decoding algorithm for RS codes. The algorithm can be used to decode the Lee-metric BCH codes, and outperforms the known Lee-metric decoding algorithm for BCH codes.
Key concepts: BCH code, Reed–Solomon error correction, Berlekamp–Welch algorithm, Metric (unit), Decoding methods, List decoding, Mathematics, Sequential decoding