New nearly optimal codebooks from relative difference sets

DOI10.3934/AMC.2011.5.521MaRDI QIDQ644327zbMATH OpenOpenAlexFDO

Authors Zhengchun Zhou, Xiaohu Tang

Publication date 3 November 2011

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

almost difference setscodebooksrelative difference setssignal setsWelch bound

Mathematics Subject Classification ID

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

Recommendations

• Two families of nearly optimal codebooks
• Codebooks from almost difference sets
• Complex Codebooks From Combinatorial Designs
• Constructions of some classes of codebooks nearly meeting the Welch bound
• A Generic Construction of Complex Codebooks Meeting the Welch Bound

Cited in

(25)

• Codebooks from almost difference sets
• Nearly optimal codebooks based on generalized Jacobi sums
• 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 from generalized Boolean bent functions over \(\mathbb{Z}_4\)
• Generalized asymptotically optimal codebooks
• Six constructions of asymptotically optimal codebooks via the character sums
• Three deterministic constructions of compressed sensing matrices with low coherence
• Two constructions of asymptotically optimal codebooks
• Two families of nearly optimal codebooks
• A new class of near-optimal partial Fourier codebooks from an almost difference set
• Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local ring and their applications
• Cayley sum graphs and their applications to codebooks
• Codes from difference sets
• The performance of difference coding for sets and relational tables
• Achieving the Welch Bound With Difference Sets
• Complex Codebooks From Combinatorial Designs
• More constructions of near optimal codebooks associated with binary sequences
• Constructions of some classes of codebooks nearly meeting the Welch bound
• New constructions of codebooks nearly meeting the Welch bound
• Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound
• Character sums over a non-chain ring and their applications
• Three constructions of asymptotically optimal codebooks via multiplicative characters of finite fields
• Construction of cyclotomic codebooks nearly meeting the Welch bound

This page was built for publication: New nearly optimal codebooks from relative difference sets

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