Ramanujan graphs and expander families constructed from \(p\)-ary bent functions

DOI10.1007/s10623-019-00692-zzbMath1439.05229OpenAlexW2983588208WikidataQ126828615 ScholiaQ126828615MaRDI QIDQ2291671

Jong Yoon Hyun, Jungyun Lee, Yoon-Jin 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

zbMATH Keywords

association schemeexpanders\(p\)-ary bent functionRamanujan graph

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (2)

Equitable partition for some Ramanujan graphs ⋮ Constructions of strongly regular Cayley graphs derived from weakly regular bent functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strongly regular graphs constructed from \(p\)-ary bent functions
• Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
• Strongly regular graphs associated with ternary bent functions
• Fourier-invariant pairs of partitions of finite Abelian groups and association schemes
• Generalized bent functions and their properties
• Ramanujan graphs
• Eigenvalues and expanders
• Cubic Ramanujan graphs
• A survey of partial difference sets
• Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
• Finite fields and Ramanujan graphs
• Entropy waves, the zig-zag graph product, and new constant-degree expanders
• Strongly regular decompositions of the complete graph
• Interlacing families. I: Bipartite Ramanujan graphs of all degrees
• Association schemes arising from bent functions
• 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 graphs in pure and applied mathematics
• Expander codes
• Expander graphs and their applications
• Sorting and Selecting in Rounds
• Characterization of <inline-formula> <tex-math notation="LaTeX">$p$ </tex-math> </inline-formula>-ary Bent Functions in Terms of Strongly Regular Graphs
• Proofs of Two Conjectures on Ternary Weakly Regular Bent Functions

This page was built for publication: Ramanujan graphs and expander families constructed from \(p\)-ary bent functions