Difference sets with few character values

From MaRDI portal
Publication:404936

DOI10.1007/S10623-013-9830-7zbMATH Open1297.05261arXiv1303.1659OpenAlexW1975131848MaRDI QIDQ404936FDOQ404936


Authors: Tao Feng, Sihuang Hu, Shuxing Li, Gennian Ge Edit this on Wikidata


Publication date: 4 September 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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. In 1997, Jungnickel and Schmidt 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.


Full work available at URL: https://arxiv.org/abs/1303.1659




Recommendations




Cites Work


Cited In (1)





This page was built for publication: Difference sets with few character values

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404936)