New nearly optimal codebooks from relative difference sets

DOI10.3934/amc.2011.5.521zbMath1231.94004OpenAlexW2054194065MaRDI QIDQ644327

Zhengchun Zhou, Xiaohu Tang

Publication date: 3 November 2011

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2011.5.521

zbMATH Keywords

relative difference setsWelch boundcodebookssignal setsalmost difference sets

Mathematics Subject Classification ID

Bounds on codes (94B65) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Other types of codes (94B60)

Related Items (16)

Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\) ⋮ Generalized asymptotically optimal codebooks ⋮ Six constructions of asymptotically optimal codebooks via the character sums ⋮ 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 ⋮ Three deterministic constructions of compressed sensing matrices with low coherence ⋮ Cayley sum graphs and their applications to codebooks ⋮ More constructions of near optimal codebooks associated with binary sequences ⋮ Two constructions of asymptotically optimal codebooks according to the Welch bound ⋮ Two classes of near-optimal codebooks with respect to the Welch bound ⋮ Two constructions of asymptotically optimal codebooks via the trace functions ⋮ Nearly optimal codebooks based on generalized Jacobi sums ⋮ 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: New nearly optimal codebooks from relative difference sets