Construction of cyclotomic codebooks nearly meeting the Welch bound

DOI10.1007/S10623-011-9549-2zbMATH Open1236.94014OpenAlexW2020089954MaRDI QIDQ766244FDOQ766244

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Lower bounds on the maximum cross correlation of signals (Corresp.)
• Complex Codebooks From Combinatorial Designs
• 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

Cited In (23)

• Three constructions of asymptotically optimal codebooks via multiplicative characters of finite fields
• Two families of nearly optimal codebooks
• Two constructions of asymptotically optimal codebooks according to the Welch bound
• Constructions of some classes of codebooks nearly meeting the Welch bound
• New constructions of codebooks nearly meeting the Welch bound
• Two classes of near-optimal codebooks with respect to 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
• Character sums over a non-chain ring and their applications
• Unit time-phase signal sets with the explicit maximum cross ambiguity amplitudes
• 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
• New constructions of asymptotically optimal codebooks via cyclotomic classes of order 8
• Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\)
• 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)