2022/08/18 by Eiichi Bannaĭ, Bannai, Eiichi, Tsuyoshi Miezaki +3
Computer Science · Engineering · #Coding theory and cryptography #graph theory and CDMA systems #Cellular Automata and Applications
paper · pdf · doi:10.48550/arxiv.2208.09077
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.