2000 character limit reached
On perfect codes that do not contain Preparata-like codes (1512.03048v3)
Published 9 Dec 2015 in cs.IT and math.IT
Abstract: We show that for every length of form $4k-1$, there exists a binary $1$-perfect code that does not include any Preparata-like code.
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.