Ramanujan graphs and expander families constructed from p-ary bent functions
DOI10.1007/S10623-019-00692-ZzbMATH Open1439.05229OpenAlexW2983588208WikidataQ126828615 ScholiaQ126828615MaRDI QIDQ2291671FDOQ2291671
Authors: Jong Yoon Hyun, Jungyun Lee, Yoonjin Lee 
Publication date: 31 January 2020
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-019-00692-z
Recommendations
- Strongly regular graphs constructed from \(p\)-ary bent functions
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- Finite fields and Ramanujan graphs
- Explicit construction of Ramanujan bigraphs
- Expanding graphs, Ramanujan graphs, and 1-factor perturbations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)
Cites Work
- Eigenvalues and expanders
- A survey of partial difference sets
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Association schemes arising from bent functions
- The CRC handbook of combinatorial designs
- Strongly regular graphs associated with ternary bent functions
- Fourier-invariant pairs of partitions of finite Abelian groups and association schemes
- Expander graphs in pure and applied mathematics
- Expander codes
- Title not available (Why is that?)
- Expander graphs and their applications
- Generalized bent functions and their properties
- Ramanujan graphs
- Proofs of Two Conjectures on Ternary Weakly Regular Bent Functions
- Cubic Ramanujan graphs
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Title not available (Why is that?)
- Uniformly Exhaustive Submeasures and Nearly Additive Set Functions
- Title not available (Why is that?)
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
- Strongly regular graphs constructed from \(p\)-ary bent functions
- Strongly regular decompositions of the complete graph
- Sorting and Selecting in Rounds
- Expander families and Cayley graphs. A beginner's guide
- Finite fields and Ramanujan graphs
- Characterization of <inline-formula> <tex-math notation="LaTeX">$p$ </tex-math> </inline-formula>-ary Bent Functions in Terms of Strongly Regular Graphs
- The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs
Cited In (6)
- Title not available (Why is that?)
- Characterization of weakly regular \(p\)-ary bent functions of \(\ell \)-form
- Expanding graphs, Ramanujan graphs, and 1-factor perturbations
- Constructions of strongly regular Cayley graphs derived from weakly regular bent functions
- Equitable partition for some Ramanujan graphs
- Connection of \(p\)-ary \(t\)-weight linear codes to Ramanujan Cayley graphs with \(t+1\) eigenvalues
This page was built for publication: Ramanujan graphs and expander families constructed from \(p\)-ary bent functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2291671)
