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

Authors

489

  1. GO
    Giacomo Oliveri

    University of Trento, Italy

    14 publications · 764 citations

    14

    h-index

  2. CD
    Cunsheng Ding

    Hong Kong University of Science and Technology, Hong Kong SAR China

    15 publications · 1.4K citations

    14

    h-index

  3. QX
    Qing Xiang

    University of Delaware, United States

    18 publications · 448 citations

    12

    h-index

  4. JA
    James A. Davis

    University of Richmond, United States

    18 publications · 374 citations

    11

    h-index

  5. KT
    K. T. Arasu

    Wright State University, United States

    11 publications · 334 citations

    10

    h-index

1–5 of 489

Venues

  1. IEEE Transactions on Information Theory

    42 publications · 2.5K citations

    25

    h-index

  2. Journal of Combinatorial Theory Series A

    47 publications · 1.9K citations

    24

    h-index

  3. Designs Codes and Cryptography

    32 publications · 926 citations

    17

    h-index

  4. Discrete Mathematics

    20 publications · 420 citations

    14

    h-index

  5. 14

    h-index

1–5