Nearly optimal codebooks based on generalized Jacobi sums

DOI10.1016/j.dam.2018.05.017zbMath1457.94234arXiv1705.08055OpenAlexW2964262548MaRDI QIDQ1801063

Ziling Heng

Publication date: 26 October 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

compressed sensingWelch boundLevenshtein boundcodebookssignal setscode division multiple access

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other character sums and Gauss sums (11T24)

Related Items

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, 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, A further construction of asymptotically optimal codebooks with multiplicative characters, Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms, Two constructions of asymptotically optimal codebooks via the trace functions, New constructions of asymptotically optimal codebooks via cyclotomic classes of order 8, Two constructions of asymptotically optimal codebooks, New Constructions of Codebooks Nearly Meeting the Welch Bound

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\)
• New nearly optimal codebooks from relative difference sets
• Steiner equiangular tight frames
• On the existence of equiangular tight frames
• Grassmannian frames with applications to coding and communication
• Geometry of the Welch bounds
• Two families of nearly optimal codebooks
• A new class of near-optimal partial Fourier codebooks from an almost difference set
• Construction ofk-Angle Tight Frames
• Equiangular Tight Frames From Hyperovals
• Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound
• New Families of Codebooks Achieving the Levenstein Bound
• Deterministic Sensing Matrices Arising From Near Orthogonal Systems
• Construction of Incoherent Unit Norm Tight Frames With Application to Compressed Sensing
• Grassmannian beamforming for multiple-input multiple-output wireless systems
• On beamforming with finite rate feedback in multiple-antenna systems
• 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.)
• Z₄ -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
• Systematic design of unitary space-time constellations
• New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters
• Existence and construction of noncoherent unitary space-time codes
• Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
• Two Classes of Codebooks Nearly Meeting the Welch Bound
• New Constructions of Codebooks Nearly Meeting the Welch Bound With Equality
• Quantized frame expansions with erasures