2000 character limit reached
A note on the Assmus--Mattson theorem for some binary codes II
Published 18 Aug 2022 in math.CO, cs.IT, math.GR, math.IT, and math.NT | (2208.09077v4)
Abstract: Let $C$ be a four-weight binary code, which has all one vector. Furthermore, we assume that $C$ supports $t$-designs for all weights obtained from the Assmus--Mattson theorem. We previously showed that $t\leq 5$. In the present paper, we show an analogue of this result in the cases of five and six-weight codes.
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.
