Nearly optimal codebooks based on generalized Jacobi sums
From MaRDI portal
Publication:1801063
DOI10.1016/J.DAM.2018.05.017zbMATH Open1457.94234arXiv1705.08055OpenAlexW2964262548WikidataQ129641225 ScholiaQ129641225MaRDI QIDQ1801063FDOQ1801063
Authors: Ziling Heng 
Publication date: 26 October 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Abstract: Codebooks with small inner-product correlation are applied in many practical applications including direct spread code division multiple access (CDMA) communications, space-time codes and compressed sensing. It is extremely difficult to construct codebooks achieving the Welch bound or the Levenshtein bound. Constructing nearly optimal codebooks such that the ratio of its maximum cross-correlation amplitude to the corresponding bound approaches 1 is also an interesting research topic. In this paper, we firstly study a family of interesting character sums called generalized Jacobi sums over finite fields. Then we apply the generalized Jacobi sums and their related character sums to obtain two infinite classes of nearly optimal codebooks with respect to the Welch or Levenshtein bound. The codebooks can be viewed as generalizations of some known ones and contain new ones with very flexible parameters.
Full work available at URL: https://arxiv.org/abs/1705.08055
Recommendations
- A further construction of asymptotically optimal codebooks with multiplicative characters
- Constructions of some classes of codebooks nearly meeting the Welch bound
- Two classes of near-optimal codebooks with respect to the Welch bound
- Two families of nearly optimal codebooks
- New nearly optimal codebooks from relative difference sets
Cites Work
- Quantized frame expansions with erasures
- Grassmannian frames with applications to coding and communication
- On the existence of equiangular tight frames
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Steiner equiangular tight frames
- Achieving the Welch Bound With Difference Sets
- Title not available (Why is that?)
- Deterministic Sensing Matrices Arising From Near Orthogonal Systems
- Title not available (Why is that?)
- Grassmannian beamforming for multiple-input multiple-output wireless systems
- Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
- On beamforming with finite rate feedback in multiple-antenna systems
- Z4 -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
- Two families of nearly optimal codebooks
- Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound
- New Families of Codebooks Achieving the Levenstein Bound
- Complex Codebooks From Combinatorial Designs
- A Generic Construction of Complex Codebooks Meeting the Welch Bound
- Title not available (Why is that?)
- Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\)
- Two Classes of Codebooks Nearly Meeting the Welch Bound
- A new class of near-optimal partial Fourier codebooks from an almost difference set
- New nearly optimal codebooks from relative difference sets
- Systematic design of unitary space-time constellations
- Construction of \(k\)-angle tight frames
- Equiangular Tight Frames From Hyperovals
- Geometry of the Welch bounds
- Construction of Incoherent Unit Norm Tight Frames With Application to Compressed Sensing
- New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters
- Existence and construction of noncoherent unitary space-time codes
- New Constructions of Codebooks Nearly Meeting the Welch Bound With Equality
Cited In (15)
- Three constructions of asymptotically optimal codebooks via multiplicative characters of finite fields
- The Jacobi sums over Galois rings of arbitrary characters and their applications in constructing asymptotically optimal codebooks
- New constructions of codebooks nearly meeting the Welch bound
- A new class of near-optimal partial Fourier codebooks from an almost difference set
- Character sums over a non-chain ring and their applications
- Two constructions of asymptotically optimal codebooks
- Hybrid character sums and near-optimal partial Hadamard codebooks
- Two constructions of asymptotically optimal codebooks via the trace functions
- Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\)
- Six constructions of asymptotically optimal codebooks via the character sums
- A further construction of asymptotically optimal codebooks with multiplicative characters
- Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms
- Generalized asymptotically optimal codebooks
- Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local ring and their applications
- New constructions of asymptotically optimal codebooks via cyclotomic classes of order 8
This page was built for publication: Nearly optimal codebooks based on generalized Jacobi sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801063)
