Codebooks from almost difference sets
From MaRDI portal
Publication:1008969
DOI10.1007/S10623-007-9140-ZzbMATH Open1178.94010OpenAlexW1971917606MaRDI QIDQ1008969FDOQ1008969
Authors: 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
Recommendations
Communication theory (94A05) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)
Cites Work
- Finite geometry and character theory
- A family of skew Hadamard difference sets
- Title not available (Why is that?)
- Grassmannian frames with applications to coding and communication
- Autocorrelation values of generalized cyclotomic sequences of order two
- Spherical codes and designs
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Cyclic difference sets
- Achieving the Welch Bound With Difference Sets
- Title not available (Why is that?)
- A family of difference sets
- Grassmannian beamforming for multiple-input multiple-output wireless systems
- Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
- Z4 -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
- A class of balanced binary sequences with optimal autocorrelation properties
- New families of binary sequences with optimal three-level autocorrelation
- Complex Codebooks From Combinatorial Designs
- A Generic Construction of Complex Codebooks Meeting the Welch Bound
- Title not available (Why is that?)
- Almost difference sets and their sequences with optimal autocorrelation
- Title not available (Why is that?)
- Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets
- Title not available (Why is that?)
Cited In (21)
- Two families of nearly optimal codebooks
- Title not available (Why is that?)
- Gauss periods and codebooks from generalized cyclotomic sets of order four
- New constructions of codebooks nearly meeting the Welch bound
- A new class of near-optimal partial Fourier codebooks from an almost difference set
- Character sums over a non-chain ring and their applications
- Unit time-phase signal sets with the explicit maximum cross ambiguity amplitudes
- \(p\)-adic Welch bounds and \(p\)-adic Zauner conjecture
- Hybrid character sums and near-optimal partial Hadamard codebooks
- Discrete and continuous Welch bounds for Banach spaces with applications
- Complex Codebooks From Combinatorial Designs
- On two applications of polynomials \(x^k-cx-d\) over finite fields and more
- Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\)
- Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms
- Codes from difference sets
- New constructions of asymptotically optimal codebooks via cyclotomic classes of order 8
- Construction of cyclotomic codebooks nearly meeting the Welch bound
- New classes of asymptotically optimal spectrally-constrained sequences derived from cyclotomy
- Cayley sum graphs and their applications to codebooks
- More constructions of near optimal codebooks associated with binary sequences
- New nearly optimal codebooks from relative difference sets
This page was built for publication: Codebooks from almost difference sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1008969)