2000 character limit reached
Z4-Linear Perfect Codes
Published 1 Oct 2007 in cs.IT and math.IT | (0710.0198v1)
Abstract: For every $n = 2k > 8$ there exist exactly $[(k+1)/2]$ mutually nonequivalent $Z_4$-linear extended perfect codes with distance 4. All these codes have different ranks.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
