A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Combinatorial t-designs have been an interesting topic in combinatorics for decades. It is a basic fact that the codewords of a fixed weight in a code may hold a t-design. Till now only a small amount of work on constructing t-designs from codes has been done. In this paper, we determine the weight distributions of two classes of cyclic codes: one related to the tripleerror correcting binary BCH codes, and the other related to the cyclic codes with parameters satisfying the generalized Kasamidoi:10.3934/amc.2020106 fatcat:g2kh4id4l5hzvkn5i4yfcfluo4