Two classes of asymptotically optimal codebooks based on hybrid character sums

DOI10.20142/J.CNKI.AMAS.202401060MaRDI QIDQ6914516zbMATH OpenFDO

Authors Mengjie Yang, Zilingy Heng, Xiaoru Li

Publication date 16 October 2025

Published in Acta Mathematicae Applicatae Sinica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.20142/J.CNKI.AMAS.202401060

zbMATH Keywords

codebookweakly regular bent functionsWelch bound

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Cites work

• A Construction of Codebooks Associated With Binary Sequences
• A Generic Construction of Complex Codebooks Meeting the Welch Bound
• Achieving the Welch Bound With Difference Sets
• Codebooks from almost difference sets
• Complex Codebooks From Combinatorial Designs
• Construction of cyclotomic codebooks nearly meeting the Welch bound
• Construction of Incoherent Unit Norm Tight Frames With Application to Compressed Sensing
• Equiangular Tight Frames From Hyperovals
• Existence and construction of noncoherent unitary space-time codes
• Grassmannian frames with applications to coding and communication
• scientific article; zbMATH DE number 47996 (Why is no real title available?)
• scientific article; zbMATH DE number 1740059 (Why is no real title available?)
• scientific article; zbMATH DE number 826047 (Why is no real title available?)
• Hybrid character sums and near-optimal partial Hadamard codebooks
• Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
• Lower bounds on the maximum cross correlation of signals (Corresp.)
• Monomial and quadratic bent functions over the finite fields of odd characteristic
• Near-Optimal Partial Hadamard Codebook Construction Using Binary Sequences Obtained From Quadratic Residue Mapping
• New Binomial Bent Functions Over the Finite Fields of Odd Characteristic
• New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters
• New Constructions of Codebooks Nearly Meeting the Welch Bound With Equality
• Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
• Steiner equiangular tight frames
• Two Classes of Codebooks Nearly Meeting the Welch Bound
• Two families of nearly optimal codebooks

This page was built for publication: Two classes of asymptotically optimal codebooks based on hybrid character sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6914516)