Extended 1-perfect additive codes

J.Borges, K.T.Phelps, J.Rifa

Abstract. A binary extended 1-perfect code of length n+1 = 2t is additive if it is a subgroup of Z2a ×Z4b. The punctured code by deleting a Z2 coordinate (if there is someone) gives a perfect additive code. 1-Perfect additive codes were completely characterized before by the authors and by using that characterization we compute the possible parameters k, rank and dimension of the kernel for extended 1-perfect additive codes. A very special case is that of extended 1-perfect Z4- linear codes.

Key words: 1-perfect codes, Z4- linear codes, kernel, rank

Registration: PIRDI-1/02, May 2002.

Retrieve PDF document (pirdi16.pdf: 166498 bytes)

Retrieve DVI document (pirdi16.dvi: 58084 bytes)

Copyright © 2002 by Computer Science Department. UAB