Generating Idempotents of Sixth Residue Codes over the Binary Field (II)

DOI

10.2991/emcs-17.2017.119How to use a DOI?

Keywords

Generating idempotent; Residue code; Cyclic code

Abstract

This paper gives explicit expressions of generating idempotents of sixth residue codes of length over the binary field, where is a prime with . 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 sixth 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  - Xuedong Dong
AU  - Yan Zhang
PY  - 2017/03
DA  - 2017/03
TI  - Generating Idempotents of Sixth Residue Codes over the Binary Field (II)
BT  - Proceedings of the 2017 7th International Conference on Education, Management, Computer and Society (EMCS 2017)
PB  - Atlantis Press
SP  - 612
EP  - 617
SN  - 2352-538X
UR  - https://doi.org/10.2991/emcs-17.2017.119
DO  - 10.2991/emcs-17.2017.119
ID  - Dong2017/03
ER  -