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

DOI10.1007/S10623-019-00692-ZMaRDI QIDQ2291671zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

association scheme\(p\)-ary bent functionexpandersRamanujan graph

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 428989 (Why is no real title available?)
• scientific article; zbMATH DE number 6900655 (Why is no real title available?)
• scientific article; zbMATH DE number 1849959 (Why is no real title available?)
• A survey of partial difference sets
• Association schemes arising from bent functions
• Characterization of <inline-formula> <tex-math notation="LaTeX">$p$ </tex-math> </inline-formula>-ary Bent Functions in Terms of Strongly Regular Graphs
• Cubic Ramanujan graphs
• Eigenvalues and expanders
• Entropy waves, the zig-zag graph product, and new constant-degree expanders
• Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
• Expander codes
• Expander families and Cayley graphs. A beginner's guide
• Expander graphs and their applications
• Expander graphs in pure and applied mathematics
• Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
• Finite fields and Ramanujan graphs
• Fourier-invariant pairs of partitions of finite Abelian groups and association schemes
• Generalized bent functions and their properties
• Interlacing families. I: Bipartite Ramanujan graphs of all degrees
• Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
• Proofs of Two Conjectures on Ternary Weakly Regular Bent Functions
• Ramanujan graphs
• Sorting and Selecting in Rounds
• Strongly regular decompositions of the complete graph
• Strongly regular graphs associated with ternary bent functions
• Strongly regular graphs constructed from \(p\)-ary bent functions
• The CRC handbook of combinatorial designs
• The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs
• Uniformly Exhaustive Submeasures and Nearly Additive Set Functions

Cited in

(6)

• scientific article; zbMATH DE number 1465652 (Why is no real title available?)
• 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)