Codebooks from almost difference sets

DOI10.1007/s10623-007-9140-zzbMath1178.94010OpenAlexW1971917606MaRDI QIDQ1008969

Cunsheng Ding, Tao Feng

Publication date: 31 March 2009

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

Full work available at URL: https://doi.org/10.1007/s10623-007-9140-z

Mathematics Subject Classification ID

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

Related Items (15)

Gauss periods and codebooks from generalized cyclotomic sets of order four ⋮ Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\) ⋮ Hybrid character sums and near-optimal partial Hadamard codebooks ⋮ New classes of asymptotically optimal spectrally-constrained sequences derived from cyclotomy ⋮ Character sums over a non-chain ring and their applications ⋮ On two applications of polynomials \(x^k-cx-d\) over finite fields and more ⋮ Cayley sum graphs and their applications to codebooks ⋮ Unnamed Item ⋮ A new class of near-optimal partial Fourier codebooks from an almost difference set ⋮ More constructions of near optimal codebooks associated with binary sequences ⋮ Unit time-phase signal sets with the explicit maximum cross ambiguity amplitudes ⋮ Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms ⋮ New constructions of asymptotically optimal codebooks via cyclotomic classes of order 8 ⋮ Two families of nearly optimal codebooks ⋮ New Constructions of Codebooks Nearly Meeting the Welch Bound

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A family of skew Hadamard difference sets
• Spherical codes and designs
• Grassmannian frames with applications to coding and communication
• Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets
• Finite geometry and character theory
• Cyclic difference sets
• Grassmannian beamforming for multiple-input multiple-output wireless systems
• Achieving the Welch Bound With Difference Sets
• Complex Codebooks From Combinatorial Designs
• A Generic Construction of Complex Codebooks Meeting the Welch Bound
• Lower bounds on the maximum cross correlation of signals (Corresp.)
• A class of balanced binary sequences with optimal autocorrelation properties
• Z₄ -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
• New families of binary sequences with optimal three-level autocorrelation
• Almost difference sets and their sequences with optimal autocorrelation
• Autocorrelation values of generalized cyclotomic sequences of order two
• Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
• A family of difference sets

This page was built for publication: Codebooks from almost difference sets