Codes, cubes, and graphical designs

DOI10.1007/s00041-021-09852-zzbMath1472.05030arXiv2012.12376OpenAlexW3196337253MaRDI QIDQ1982601

Catherine Babecki

Publication date: 14 September 2021

Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.12376

zbMATH Keywords

association schemesHamming code\(t\)-designsspherical designsstable setserror correcting codesgraph LaplacianHoffman boundgraph samplingCheeger boundgraphical designsSobolev-Lebedev quadrature

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Association schemes, strongly regular graphs (05E30) Graph theory (including graph drawing) in computer science (68R10) Other designs, configurations (05B30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (4)

Overview of the topical collection: harmonic analysis on combinatorial graphs ⋮ Optimal and extremal graphical designs on regular graphs associated with classical parameters ⋮ Graphical designs and gale duality ⋮ Eigenpolytope Universality and Graphical Designs

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal asymptotic bounds for spherical designs
• Spectra of graphs
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Spherical codes and designs
• Association schemes with multiple Q-polynomial structures
• Graphical designs and extremal combinatorics
• Well-separated spherical designs
• Hoffman's ratio bound
• Harmonic Function Theory
• Explicit Concentrators from Generalized N-Gons
• On Linear Associative Algebras Corresponding to Association Schemes of Partially Balanced Designs
• Sampling in Paley-Wiener spaces on combinatorial graphs
• Combinatorial Designs
• A sampling theorem on homogeneous manifolds
• Error Detecting and Error Correcting Codes
• Signals on Graphs: Uncertainty Principle and Sampling
• Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
• Numerical integration on graphs: Where to sample and how to weigh
• Generalized designs on graphs: Sampling, spectra, symmetries

This page was built for publication: Codes, cubes, and graphical designs