Two constructions of asymptotically optimal codebooks

DOI10.1007/s12095-018-0331-4zbMath1459.94169OpenAlexW2894759095MaRDI QIDQ2311434

Xiwang Cao, Gaojun Luo

Publication date: 10 July 2019

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-018-0331-4

zbMATH Keywords

codebookasymptotic optimalityWelch boundhyper Eisenstein sum

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15)

Related Items (4)

Generalized asymptotically optimal codebooks ⋮ Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• More constructions of near optimal codebooks associated with binary sequences
• New nearly optimal codebooks from relative difference sets
• Steiner equiangular tight frames
• Construction of cyclotomic codebooks nearly meeting the Welch bound
• Spherical codes and designs
• Grassmannian frames with applications to coding and communication
• Nearly optimal codebooks based on generalized Jacobi sums
• Two families of nearly optimal codebooks
• Tremain equiangular tight frames
• Equiangular Tight Frames From Hyperovals
• Near-Optimal Partial Hadamard Codebook Construction Using Binary Sequences Obtained From Quadratic Residue Mapping
• Construction of Incoherent Unit Norm Tight Frames With Application to Compressed Sensing
• A Construction of Codebooks Associated With Binary Sequences
• 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.)
• New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters
• 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

This page was built for publication: Two constructions of asymptotically optimal codebooks