A note on the Assmus--Mattson theorem for some binary codes II
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≤ 5. In the present paper, we show an analogue of this result in the cases of five and six-weight codes.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.