A note on the Assmus–Mattson theorem for some binary codes II

08/18/2022

∙

by   Eiichi Bannai, et al.

∙

0

∙

share

Let C be a four-weight code, which has all one vector. Furthermore, we assume that C_ℓ are t-designs for all ℓ by 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.