In this paper we prove that any additive extended Preparata- like code always verifies a = 0, i.e. it is always a \Z4- linear code. Moreover, we compute the rank and the dimension of the kernel of such Preparata-like codes and also the rank and the kernel of the Z4-dual of these codes, i.e. the Z4- linear Kerdock-like codes.
Key words: Preparata Codes, Kerdock Codes, Kernel, Rank.
Registration: PIRDI-2/02, July 2002.
Retrieve DVI document (pirdi17.dvi: 93592 bytes)