A note on the Assmus--Mattson theorem for some ternary codes (a resume)

2023/09/15 by Bannai, Eiichi, Miezaki, Tsuyoshi, Nakasora, Hiroyuki
#20B25 #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Primary 05B05 #Secondary 94B05

paper · doi:10.48550/arxiv.2309.08081

Abstract

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.

Related

• A note on the Assmus--Mattson theorem for some binary codes
• A note on the Assmus--Mattson theorem for some binary codes II
• A note on Assmus--Mattson type theorems
• On the Assmus--Mattson type theorem for Type I and even formally self-dual codes
• Steiner systems S(2, 4, (3^m-1)/(2)) and 2-designs from ternary linear codes of length (3^m-1)/(2)