A note on the Assmus–Mattson theorem for some non-binary codes (a resume)

09/15/2023

∙

by   Eiichi Bannai, et al.

∙

0

∙

share

Let C be a two and three-weight ternary code. Furthermore, we assume that C_ℓ are t-designs for all ℓ by the Assmus–Mattson theorem. We show that t ≤ 5. As a corollary, we provide a new characterization of the (extended) ternary Golay code.