A Construction of Codebooks Associated With Binary Sequences
From MaRDI portal
Publication:2989861
DOI10.1109/TIT.2012.2196021zbMath1364.94638MaRDI QIDQ2989861
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (14)
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 ⋮ Cayley sum graphs and their applications to codebooks ⋮ A new class of near-optimal partial Fourier codebooks from an almost difference set ⋮ 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 ⋮ New constructions of asymptotically optimal codebooks via cyclotomic classes of order 8 ⋮ Two constructions of asymptotically optimal codebooks ⋮ Two families of nearly optimal codebooks ⋮ New Constructions of Codebooks Nearly Meeting the Welch Bound
This page was built for publication: A Construction of Codebooks Associated With Binary Sequences
