Constructions of strongly regular Cayley graphs derived from weakly regular bent functions
From MaRDI portal
Recommendations
- Strongly regular graphs constructed from \(p\)-ary bent functions
- Strongly regular graphs from unions of cyclotomic classes
- Strongly regular graphs associated with ternary bent functions
- Generalized bent Boolean functions and strongly regular Cayley graphs
- Constructions of strongly regular Cayley graphs using index four Gauss sums
Cites work
- A characterization of bent functions in terms of strongly regular graphs
- A construction of binary linear codes from Boolean functions
- A survey of partial difference sets
- Association schemes arising from bent functions
- Construction of strongly regular Cayley graphs based on three-valued Gauss periods
- Constructions of strongly regular Cayley graphs using even index Gauss sums
- Constructions of strongly regular Cayley graphs using index four Gauss sums
- Cubic Ramanujan graphs
- Cyclotomy and strongly regular graphs
- 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\)
- Expander codes
- Expanders, randomness, or time versus space
- Finite fields and Ramanujan graphs
- Hard examples for resolution
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 47996 (Why is no real title available?)
- scientific article; zbMATH DE number 3539225 (Why is no real title available?)
- scientific article; zbMATH DE number 3597878 (Why is no real title available?)
- scientific article; zbMATH DE number 6900655 (Why is no real title available?)
- Linear codes with few weights from cyclotomic classes and weakly regular bent functions
- Linear codes with two or three weights from quadratic bent functions
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
- Linear-time encodable and decodable error-correcting codes
- Monomial and quadratic bent functions over the finite fields of odd characteristic
- New Binomial Bent Functions Over the Finite Fields of Odd Characteristic
- On ``bent functions
- Ramanujan graphs
- Ramanujan graphs and expander families constructed from \(p\)-ary bent functions
- Rearrangeable Networks with Limited Depth
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Sorting and Selecting in Rounds
- Spectra of graphs
- Strongly regular decompositions of the complete graph
- Strongly regular graphs associated with ternary bent functions
- Strongly regular graphs constructed from \(p\)-ary bent functions
- Strongly regular graphs from unions of cyclotomic classes
- Strongly regular graphs, partial geometries and partially balanced designs
- The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs
- The Geometry of Two-Weight Codes
- The product replacement algorithm and Kazhdan's property (T)
- Uniformly Exhaustive Submeasures and Nearly Additive Set Functions
This page was built for publication: Constructions of strongly regular Cayley graphs derived from weakly regular bent functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204333)
