Generating Idempotents of Residue Codes over The Binary Field

DOI

10.2991/icemc-17.2017.17How to use a DOI?

Keywords

Generating idempotent; Residue code; Cyclic code

Abstract

This paper gives explicit expressions of generating idempotents of higher power residues codes of length over the binary field, where is a prime. By computing the greatest common divisors of these generating idempotents and the polynomial with computer software such as Matlab and Maple, one can get the generating polynomials of residue codes over the binary field .

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Dong Xuedong
AU  - Zhang Yan
PY  - 2016/06
DA  - 2016/06
TI  - Generating Idempotents of Residue Codes over The Binary Field
BT  - Proceedings of the 7th International Conference on Education, Management, Information and Computer Science (ICEMC 2017)
PB  - Atlantis Press
SP  - 80
EP  - 84
SN  - 2352-538X
UR  - https://doi.org/10.2991/icemc-17.2017.17
DO  - 10.2991/icemc-17.2017.17
ID  - Xuedong2016/06
ER  -