Near-Optimal Partial Hadamard Codebook Construction Using Binary Sequences Obtained From Quadratic Residue Mapping

Related Items (12)

Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\) ⋮ Six constructions of asymptotically optimal codebooks via the character sums ⋮ Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound ⋮ 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 ⋮ Direct synthesis signal sets for multi-input system identification ⋮ More constructions of near optimal codebooks associated with binary sequences ⋮ Two classes of near-optimal codebooks with respect to the Welch bound ⋮ Two constructions of asymptotically optimal codebooks via the trace functions ⋮ Two constructions of asymptotically optimal codebooks ⋮ New Constructions of Codebooks Nearly Meeting the Welch Bound

This page was built for publication: Near-Optimal Partial Hadamard Codebook Construction Using Binary Sequences Obtained From Quadratic Residue Mapping