Minimum Degree-Weighted Distance Decoding for Polynomial Residue Codes with Non-Pairwise Coprime Moduli

• DOI: 10.48550/arxiv.1703.07908
• Publication Date: 2017-01-01
• Authors: Xiao Li; Xiang–Gen Xia
• Keywords: Hamming distance; List decoding; Coprime integers; Minimum distance; Berlekamp–Welch algorithm; Degree (music)

This paper presents a new decoding for polynomial residue codes, called the minimum degree-weighted distance decoding. The newly proposed is based on and different from traditional Hamming It shown that two types of decoders, i.e., decoding, one not absolutely stronger than other, but they can complement each other points view.