2000 character limit reached
A note on the Assmus--Mattson theorem for some ternary codes (a resume)
Published 15 Sep 2023 in math.CO, cs.IT, and math.IT | (2309.08081v2)
Abstract: Let $C$ be a two and three-weight ternary code. Furthermore, we assume that $C_\ell$ are $t$-designs for all $\ell$ by the Assmus--Mattson theorem. We show that $t \leq 5$. As a corollary, we provide a new characterization of the (extended) ternary Golay code.
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.