most citedInfinite families of -designs from two classes of binary cyclic codes with three nonzeros

7 citations · 17 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2019

Infinite families of -designs from a class of linear codes related to Dembowski-Ostrom functions

Rong Wang, Xiaoni Du, Cuiling Fan +1

Due to their important applications to coding theory, cryptography, communications and statistics, combinatorial -designs have been attracted lots of research interest for decad…

math.CO20191 cited

Infinite families of -designs from a class of non-binary Kasami cyclic codes

Rong Wang, Xiaoni Du, Cuiling Fan

Combinatorial -designs have been an important research subject for many years, as they have wide applications in coding theory, cryptography, communications and statistics. The…

math.CO20193 cited

Infinite families of -designs from a class of cyclic codes with two non-zeros

Xiaoni Du, Rong Wang, Cuiling Fan

Combinatorial -designs have wide applications in coding theory, cryptography, communications and statistics. It is well known that the supports of all codewords with a fixed wei…

math.CO20197 cited

Infinite families of -designs from two classes of binary cyclic codes with three nonzeros

Xiaoni Du, Rong Wang, Chunming Tang +1

Combinatorial -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 -design. Till…

math.CO20196 cited

Infinite families of -designs from two classes of linear codes

Xiaoni Du, Rong Wang, Chunming Tang +1

The interplay between coding theory and -designs has attracted a lot of attention for both directions. It is well known that the supports of all codewords with a fixed weight in…