Minimum Degree-Weighted Distance Decoding for Polynomial Residue Codes with Non-Pairwise Coprime Moduli
Information Theory
2017-03-28 v2 math.IT
Abstract
This paper presents a new decoding for polynomial residue codes, called the minimum degree-weighted distance decoding. The newly proposed decoding is based on the degree-weighted distance and different from the traditional minimum Hamming distance decoding. It is shown that for the two types of minimum distance decoders, i.e., the minimum degree-weighted distance decoding and the minimum Hamming distance decoding, one is not absolutely stronger than the other, but they can complement each other from different points of view.
Cite
@article{arxiv.1703.07908,
title = {Minimum Degree-Weighted Distance Decoding for Polynomial Residue Codes with Non-Pairwise Coprime Moduli},
author = {Li Xiao and Xiang-Gen Xia},
journal= {arXiv preprint arXiv:1703.07908},
year = {2017}
}
Comments
4 pages