Cayley sum graphs and their applications to codebooks
From MaRDI portal
Publication:2697479
DOI10.1007/s10623-022-01152-xOpenAlexW4309554141MaRDI QIDQ2697479
Publication date: 12 April 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01152-x
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New nearly optimal codebooks from relative difference sets
- Spectra of graphs
- Steiner equiangular tight frames
- Construction of cyclotomic codebooks nearly meeting the Welch bound
- Large sets in finite fields are sumsets
- On the spectrum of projective norm-graphs
- Codebooks from almost difference sets
- Character sums and abelian Ramanujan graphs (with an appendix by Keqin Feng and Wen-Ch'ing Winnie Li)
- Spherical codes and designs
- Norm-graphs: Variations and applications
- Hash functions and Cayley graphs
- Grassmannian frames with applications to coding and communication
- Six constructions of asymptotically optimal codebooks via the character sums
- On the restricted isometry property of the Paley matrix
- Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms
- Multicolor Ramsey numbers via pseudorandom graphs
- More sets, graphs and numbers. A salute to Vera Sós and András Hajnal
- Sharp bounds for some multicolour Ramsey numbers
- Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs
- Compressed Sensing Matrices From Fourier Matrices
- New Families of Codebooks Achieving the Levenstein Bound
- Deterministic Sensing Matrices Arising From Near Orthogonal Systems
- Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves
- A Construction of Codebooks Associated With Binary Sequences
- Expander codes
- Incidences and the spectra of graphs
- The Connectivity of addition Cayley graphs
- Expander graphs and their applications
- Achieving the Welch Bound With Difference Sets
- Complex Codebooks From Combinatorial Designs
- A Generic Construction of Complex Codebooks Meeting the Welch Bound
- Diameters and Eigenvalues
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Z4 -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
- New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters
- Deterministic Construction of Sparse Sensing Matrices via Finite Geometry
- Two Constructions of Asymptotically Optimal Codebooks via the Hyper Eisenstein Sum
- Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
- Symmetric informationally complete quantum measurements
- Two Classes of Codebooks Nearly Meeting the Welch Bound
- New Constructions of Codebooks Nearly Meeting the Welch Bound With Equality
- An Explicit Sum-Product Estimate in Fp
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- An introduction to frames and Riesz bases
This page was built for publication: Cayley sum graphs and their applications to codebooks
