Constructions of strongly regular Cayley graphs derived from weakly regular bent functions
From MaRDI portal
Publication:6204333
DOI10.1016/j.disc.2024.113916OpenAlexW4391669416MaRDI QIDQ6204333
Jerod Michel, Liqin Qian, Xiwang Cao
Publication date: 27 March 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2024.113916
Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Boolean functions (94D10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A construction of binary linear codes from Boolean functions
- Linear codes with two or three weights from quadratic bent functions
- Strongly regular graphs from unions of cyclotomic classes
- Strongly regular graphs constructed from \(p\)-ary bent functions
- Spectra of graphs
- Strongly regular graphs associated with ternary bent functions
- Expanders, randomness, or time versus space
- Ramanujan graphs
- Cubic Ramanujan graphs
- On ``bent functions
- Cyclotomy and strongly regular graphs
- A survey of partial difference sets
- Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- Finite fields and Ramanujan graphs
- Construction of strongly regular Cayley graphs based on three-valued Gauss periods
- Strongly regular decompositions of the complete graph
- Constructions of strongly regular Cayley graphs using index four Gauss sums
- Linear codes with few weights from cyclotomic classes and weakly regular bent functions
- Ramanujan graphs and expander families constructed from \(p\)-ary bent functions
- Association schemes arising from bent functions
- Strongly regular graphs, partial geometries and partially balanced designs
- The product replacement algorithm and Kazhdan’s property (T)
- Constructions of Strongly Regular Cayley Graphs Using Even Index Gauss Sums
- The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
- Uniformly Exhaustive Submeasures and Nearly Additive Set Functions
- Expander codes
- Linear-time encodable and decodable error-correcting codes
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Monomial and quadratic bent functions over the finite fields of odd characteristic
- The Geometry of Two-Weight Codes
- Hard examples for resolution
- Sorting and Selecting in Rounds
- Rearrangeable Networks with Limited Depth
- A characterization of bent functions in terms of strongly regular graphs
- New Binomial Bent Functions Over the Finite Fields of Odd Characteristic
This page was built for publication: Constructions of strongly regular Cayley graphs derived from weakly regular bent functions
