A note on the Assmus--Mattson theorem for some ternary codes (a resume)
Eiichi Bannai, Tsuyoshi Miezaki, Hiroyuki Nakasora

TL;DR
This paper investigates the limitations of the Assmus--Mattson theorem when applied to certain ternary codes, establishing an upper bound on the design strength and characterizing the ternary Golay code.
Contribution
It provides a new upper bound on the design strength for two and three-weight ternary codes and offers a novel characterization of the ternary Golay code.
Findings
t 5 for the design strength
Characterization of the (extended) ternary Golay code
Limits on t-designs in ternary codes
Abstract
Let be a two and three-weight ternary code. Furthermore, we assume that are -designs for all by the Assmus--Mattson theorem. We show that . As a corollary, we provide a new characterization of the (extended) ternary Golay code.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cooperative Communication and Network Coding · graph theory and CDMA systems
