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

Abstract

Abstract. This paper gives explicit expressions of generating idempotents of sixth residue codes of length p over the binary field, where p is a prime with   7 mod 24 p . By computing the greatest common divisors of these generating idempotents and the polynomial 1 p x  with computer software such as Matlab and Maple, one can get the generating polynomials of sixth residue codes over the binary field.