Construction of cyclotomic codebooks nearly meeting the Welch bound

DOI10.1007/S10623-011-9549-2MaRDI QIDQ766244zbMATH OpenOpenAlexFDO

Authors Aixian Zhang, Keqin Feng

Publication date 23 March 2012

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-011-9549-2

zbMATH Keywords

Gauss sumcodebookdifference setGauss periodWelch boundcyclotomic numberalmost difference setcyclotomic class

Mathematics Subject Classification ID

Communication theory (94A05) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)

Recommendations

• Constructions of some classes of codebooks nearly meeting the Welch bound
• New nearly optimal codebooks from relative difference sets
• Codebooks from almost difference sets
• Complex Codebooks From Combinatorial Designs
• Two classes of near-optimal codebooks with respect to the Welch bound

Cites work

• scientific article; zbMATH DE number 1131801 (Why is no real title available?)
• scientific article; zbMATH DE number 3252237 (Why is no real title available?)
• A Generic Construction of Complex Codebooks Meeting the Welch Bound
• A new family of almost difference sets and some necessary conditions
• Almost difference sets and their sequences with optimal autocorrelation
• Complex Codebooks From Combinatorial Designs
• Lower bounds on the maximum cross correlation of signals (Corresp.)

Cited in

(23)

• Two families of nearly optimal codebooks
• Two constructions of asymptotically optimal codebooks according to the Welch bound
• Three constructions of asymptotically optimal codebooks via multiplicative characters of finite fields
• Constructions of some classes of codebooks nearly meeting the Welch bound
• Two classes of near-optimal codebooks with respect to the Welch bound
• New constructions of codebooks nearly meeting the Welch bound
• A new class of near-optimal partial Fourier codebooks from an almost difference set
• New Constructions of Codebooks Nearly Meeting the Welch Bound With Equality
• Unit time-phase signal sets with the explicit maximum cross ambiguity amplitudes
• Character sums over a non-chain ring and their applications
• Two constructions of asymptotically optimal codebooks
• Hybrid character sums and near-optimal partial Hadamard codebooks
• A Generic Construction of Complex Codebooks Meeting the Welch Bound
• Two constructions of asymptotically optimal codebooks via the trace functions
• Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\)
• Six constructions of asymptotically optimal codebooks via the character sums
• Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms
• Codes from difference sets
• Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local ring and their applications
• Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\)
• New constructions of asymptotically optimal codebooks via cyclotomic classes of order 8
• Cayley sum graphs and their applications to codebooks
• More constructions of near optimal codebooks associated with binary sequences

This page was built for publication: Construction of cyclotomic codebooks nearly meeting the Welch bound

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