This paper proves that any additive extended Preparata (1968) -like code always verifies /spl alpha/ = 0, i.e., it is always a /spl Zopf//sub 4/-linear code ...
On Z4-linear Preparata-like and Kerdock-like codes. ... Given a Preparata-like code , it from the obtained as the union is well known [19] that the code of ...
In this paper, we prove that any additive extended Preparata (1968) -like code always verifies α = 0, i.e., it is always a Z<sub>4</sub>-linear code. Moreover, ...
The class of the codes obtained in [1] includes all the quaternary linear Kerdock codes and the quaternary linear Preparata codes. Thus, another representation ...
On Z4-linear Preparata-like and Kerdock-like codes. We say that a binary code of length n is additive if it is isomorphic to a subgroup of Z ...
In this paper, we prove that any additive extended Preparata-like code always verifies α = 0, i.e., it is always a ℤ4-linear code. Moreover, we compute the rank ...
In this paper, we prove that any additive extended Preparata (1968) -like code always verifies /spl alpha/ = 0, i.e., it is always a /spl Zopf//sub 4/-linear ...
The Kerdock code appears to have twice as many codewords as the best known linear code. In the case m = 3 the Preparata code and the Kerdock codes both coincide ...
On Z4-linear Preparata-like and Kerdock-like code (Borges, Joaquim; Phelps, Kevin; Rifà, Josep and Zinoviev, Victor A.), In IEEE Trans. Inf. Theory, Volume ...
This paper introduces a novel soft-input ML decoding algorithm and a soft-input soft-output MAP decoding algorithm of generalized Kerdock codes.