Two families of nearly optimal codebooks
From MaRDI portal
Publication:2339131
DOI10.1007/s10623-013-9891-7zbMath1393.94321OpenAlexW2012229442MaRDI QIDQ2339131
Yiwei Huang, Qin Yue, Chengju Li
Publication date: 30 March 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-013-9891-7
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Other character sums and Gauss sums (11T24)
Related Items (12)
Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\) ⋮ Generalized asymptotically optimal codebooks ⋮ Six constructions of asymptotically optimal codebooks via the character sums ⋮ Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound ⋮ Hybrid character sums and near-optimal partial Hadamard codebooks ⋮ Character sums over a non-chain ring and their applications ⋮ Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local ring and their applications ⋮ Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\) ⋮ Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms ⋮ Two constructions of asymptotically optimal codebooks via the trace functions ⋮ Nearly optimal codebooks based on generalized Jacobi sums ⋮ Two constructions of asymptotically optimal codebooks
Cites Work
- Unnamed Item
- Unnamed Item
- Strongly regular graphs from unions of cyclotomic classes
- Constructions of strongly regular Cayley graphs and skew Hadamard difference sets from cyclotomic classes
- New nearly optimal codebooks from relative difference sets
- Steiner equiangular tight frames
- Construction of cyclotomic codebooks nearly meeting the Welch bound
- Partial difference sets
- Codebooks from almost difference sets
- A survey of partial difference sets
- Strongly regular Cayley graphs with \(\lambda-\mu=-1\)
- Grassmannian frames with applications to coding and communication
- Gauss periods and codebooks from generalized cyclotomic sets of order four
- A new class of near-optimal partial Fourier codebooks from an almost difference set
- A Construction of Codebooks Associated With Binary Sequences
- Achieving the Welch Bound With Difference Sets
- Complex Codebooks From Combinatorial Designs
- A Generic Construction of Complex Codebooks Meeting the Welch Bound
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Almost difference sets and their sequences with optimal autocorrelation
- Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
- On Orthogonal Matrices
- Two Classes of Codebooks Nearly Meeting the Welch Bound
This page was built for publication: Two families of nearly optimal codebooks
