Back to Search Start Over

Difference sets with few character values.

Authors :
Feng, Tao
Hu, Sihuang
Li, Shuxing
Ge, Gennian
Source :
Designs, Codes & Cryptography; Dec2014, Vol. 73 Issue 3, p825-839, 15p
Publication Year :
2014

Abstract

The known families of difference sets can be subdivided into three classes: difference sets with Singer parameters, cyclotomic difference sets, and difference sets with gcd $$(v,n)>1$$ . It is remarkable that all the known difference sets with gcd $$(v,n)>1$$ have the so-called character divisibility property. Jungnickel and Schmidt (Difference sets: an update. London Math. Soc. Lecture Note Ser., vol. 245, pp. 89-112, Cambridge University Press, Cambridge ) posed the problem of constructing difference sets with gcd $$(v,n)>1$$ that do not satisfy this property. In an attempt to attack this problem, we use difference sets with three nontrivial character values as candidates, and get some necessary conditions. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
09251022
Volume :
73
Issue :
3
Database :
Complementary Index
Journal :
Designs, Codes & Cryptography
Publication Type :
Academic Journal
Accession number :
97503117
Full Text :
https://doi.org/10.1007/s10623-013-9830-7