Difference sets with few character values
From MaRDI portal
Publication:404936
DOI10.1007/s10623-013-9830-7zbMath1297.05261arXiv1303.1659OpenAlexW1975131848MaRDI QIDQ404936
Sihuang Hu, Shuxing Li, Tao Feng, Gennian Ge
Publication date: 4 September 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.1659
Association schemes, strongly regular graphs (05E30) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectra of graphs
- Difference set constructions of DRADs and association schemes
- Polynomial addition sets and polynomial digraphs
- Multiplicative designs I: The normal and reducible cases
- Multiplicative designs II. Uniform normal and related structures
- Multiplicative cones - a family of three eigenvalue graphs
- Subschemes of some association schemes
- On the existence of abelian Hadamard difference sets and a new family of difference sets
- A unifying construction for difference sets
- Finite geometry and character theory
- On Difference Sets Whose Parameters Satisfy a Certain Relation
This page was built for publication: Difference sets with few character values