Connection of \(p\)-ary \(t\)-weight linear codes to Ramanujan Cayley graphs with \(t+1\) eigenvalues

DOI10.3934/amc.2020133zbMath1521.94080OpenAlexW3135710153MaRDI QIDQ6112241

Jong Yoon Hyun, Yansheng Wu, Yoon-Jin Lee

Publication date: 7 July 2023

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2020133

zbMATH Keywords

Cayley graphstrongly regular graphlinear codetwo-weight codeRamanujan graphweakly regular bent function

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Association schemes, strongly regular graphs (05E30)

Cites Work

• Unnamed Item
• Unnamed Item
• Linear codes with few weights from weakly regular bent functions based on a generic construction
• Strongly regular graphs constructed from \(p\)-ary bent functions
• Entropy waves, the zig-zag graph product, and new constant-degree expanders
• Binary linear codes with two or three weights from Niho exponents
• Linear codes from weakly regular plateaued functions and their secret sharing schemes
• A construction of \(q\)-ary linear codes with two weights
• Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
• A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
• Linear Codes From Some 2-Designs
• Expander graphs in pure and applied mathematics
• Expander graphs and their applications
• Cyclotomic Linear Codes of Order $3$
• The Geometry of Two-Weight Codes
• Sorting and Selecting in Rounds

This page was built for publication: Connection of \(p\)-ary \(t\)-weight linear codes to Ramanujan Cayley graphs with \(t+1\) eigenvalues