Hybrid character sums and near-optimal partial Hadamard codebooks

DOI10.1016/j.jalgebra.2023.06.009OpenAlexW4380884815MaRDI QIDQ6052932

Ziling Heng, Fuling Chen

Publication date: 25 September 2023

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgebra.2023.06.009

zbMATH Keywords

codebookequiangular tight frameweakly regular bent functionhybrid character sum

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Estimates on exponential sums (11L07) Exponential sums (11T23) Communication theory (94A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\)
• Cyclotomic constructions of skew Hadamard difference sets
• Steiner equiangular tight frames
• Construction of cyclotomic codebooks nearly meeting the Welch bound
• Codebooks from almost difference sets
• Grassmannian frames with applications to coding and communication
• Nearly optimal codebooks based on generalized Jacobi sums
• Cameron-Liebler line classes with parameter \(x = \frac{ ( q + 1 )^2}{ 3} \)
• Two constructions of asymptotically optimal codebooks via the trace functions
• Two families of nearly optimal codebooks
• Equiangular Tight Frames From Hyperovals
• Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
• Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound
• New Families of Codebooks Achieving the Levenstein Bound
• Near-Optimal Partial Hadamard Codebook Construction Using Binary Sequences Obtained From Quadratic Residue Mapping
• Deterministic Sensing Matrices Arising From Near Orthogonal Systems
• New Polyphase Sequence Families With Low Correlation Derived From the Weil Bound of Exponential Sums
• Several New Classes of Bent Functions From Dillon Exponents
• A Construction of Codebooks Associated With Binary Sequences
• An Introduction to Frames
• Monomial and quadratic bent functions over the finite fields of odd characteristic
• 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
• Editors' Note on Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
• Systematic design of unitary space-time constellations
• New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters
• Symmetric informationally complete quantum measurements
• Two Classes of Codebooks Nearly Meeting the Welch Bound
• New Binomial Bent Functions Over the Finite Fields of Odd Characteristic
• Two constructions of approximately symmetric informationally complete positive operator-valued measures
• On Some Exponential Sums

This page was built for publication: Hybrid character sums and near-optimal partial Hadamard codebooks