There is exactly one Z₂ Z₄-cyclic 1-perfect code

Abstract: Let

c a l C

be a

{m a t h b b Z}_{2} {m a t h b b Z}_{4}

-additive code of length

n > 3

. We prove that if the binary Gray image of

c a l C

,

C = P h i (c a l C)

, is a 1-perfect nonlinear code, then

c a l C

cannot be a

{m a t h b b Z}_{2} {m a t h b b Z}_{4}

-cyclic code except for one case of length

n = 15

. Moreover, we give a parity check matrix for this cyclic code. Adding an even parity check coordinate to a

{m a t h b b Z}_{2} {m a t h b b Z}_{4}

-additive 1-perfect code gives an extended 1-perfect code. We also prove that any such code cannot be

{m a t h b b Z}_{2} {m a t h b b Z}_{4}

-cyclic.

Recommendations

Cites work

Cited in

(2)

This page was built for publication: There is exactly one \(\mathbb {Z}_2 \mathbb {Z}_4\)-cyclic 1-perfect code