7 citations · 13 across the 7 of their papers we have counts for
9 papers · 1 filter
New nonexistence results on -generalized bent functions
Ka Hin Leung, Qi Wang
In this paper, we present some new nonexistence results on -generalized bent functions, which improved recent results. More precisely, we derive new nonexistence results for…
Placement Delivery Arrays from Combinations of Strong Edge Colorings
Jerod Michel, Qi Wang
It has recently been pointed out in both of the works [C. Shanguan, Y. Zhang, and G. Ge, {\em IEEE Trans. Inform. Theory}, 64(8):5755-5766 (2018)] and [Q. Yan, X. Tang, Q. Chen, an…
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…
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…
Cyclotomy, difference sets, sequences with low correlation, strongly regular graphs, and related geometric substructures
Koji Momihara, Qi Wang, Qing Xiang
In this paper, we survey constructions of and nonexistence results on combinatorial/geometric structures which arise from unions of cyclotomic classes of finite fields. In particul…
Almost Designs and Their Links with Balanced Incomplete Block Designs
Jerod Michel, Qi Wang
Almost designs (-adesigns) were proposed and discussed by Ding as a certain generalization of combinatorial designs related to almost difference sets. Unlike -designs, it is…