2000 character limit reached
Z4-linear Hadamard and extended perfect codes (0710.0199v1)
Published 1 Oct 2007 in cs.IT and math.IT
Abstract: If $N=2k > 8$ then there exist exactly $[(k-1)/2]$ pairwise nonequivalent $Z_4$-linear Hadamard $(N,2N,N/2)$-codes and $[(k+1)/2]$ pairwise nonequivalent $Z_4$-linear extended perfect $(N,2N/2N,4)$-codes. A recurrent construction of $Z_4$-linear Hadamard codes is given.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.