On irreducible polynomial remainder codes

@article{Yu2011OnIP,
  title={On irreducible polynomial remainder codes},
  author={Jiun-Hung Yu and Hans-Andrea Loeliger},
  journal={2011 IEEE International Symposium on Information Theory Proceedings},
  year={2011},
  pages={1190-1194}
}
A general class of polynomial remainder codes is considered. These codes are very flexible in rate and length and include Reed-Solomon codes as a special case. In general, the code symbols of such codes are polynomials of different degree, which leads to two different notions of weights and of distances. The notion of an error locator polynomial is generalized to such codes. A key equation is proposed, from which the error locator polynomial can be computed by means of a gcd algorithm. From the… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 14 citations