Difference Sets
Difference Sets is a combinatorial construct in additive combinatorics and finite geometry defined as a subset of a finite group such that every non-identity element of the group arises as a difference of exactly λ distinct pairs of elements from the set, for some fixed positive integer λ.
435
Publications
16.8K
Citations
489
Authors
297
Institutions
Publications per year
2017–2026
32
435
Character sums and difference sets
R. Turyn · Pacific Journal of Mathematics · 1965 · 315 citations · Full text
Linear Codes From Some 2-Designs
Cunsheng Ding · IEEE Transactions on Information Theory · 2015 · 308 citations
1–5 of 435
489
14
h-index
Hong Kong University of Science and Technology, Hong Kong SAR China
15 publications · 1.4K citations
14
h-index
12
h-index
11
h-index
10
h-index
1–5 of 489
297
The Ohio State University
Columbus, United States
15 h-index
24 publications
732 citations

University of Trento
Trento, Italy
15 h-index
50 publications
3.2K citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
13 h-index
16 publications
1.7K citations
National University of Singapore
Singapore, Singapore
13 h-index
29 publications
990 citations

University of Richmond
Richmond, United States
11 h-index
17 publications
337 citations
University of Delaware
Newark, United States
11 h-index
16 publications
442 citations
University of Rhode Island
Kingston, United States
10 h-index
12 publications
251 citations
Wright State University
Dayton, United States
10 h-index
13 publications
362 citations
1–8 of 297
42 publications · 2.5K citations
25
h-index
47 publications · 1.9K citations
24
h-index
32 publications · 926 citations
17
h-index
20 publications · 420 citations
14
h-index
21 publications · 375 citations
14
h-index
1–5