A new class of near-optimal partial Fourier codebooks from an almost difference set

DOI10.1007/s10623-012-9753-8zbMath1288.94007OpenAlexW1994984340MaRDI QIDQ2448090

Aixian Zhang, Nam Yul Yu, Ke Qin Feng

Publication date: 29 April 2014

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

Full work available at URL: https://doi.org/10.1007/s10623-012-9753-8

zbMATH Keywords

framesWelch boundcodebooksalmost difference setsmodular Golomb rulers

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Communication theory (94A05)

Related Items (4)

More constructions of near optimal codebooks associated with binary sequences ⋮ Two classes of near-optimal codebooks with respect to the Welch bound ⋮ Nearly optimal codebooks based on generalized Jacobi sums ⋮ Two families of nearly optimal codebooks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New cyclic difference sets with Singer parameters
• Steiner equiangular tight frames
• Construction of cyclotomic codebooks nearly meeting the Welch bound
• Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery
• Codebooks from almost difference sets
• Theorems in the additive theory of numbers
• Almost difference sets and reversible divisible difference sets
• Grassmannian frames with applications to coding and communication
• A review of the available construction methods for Golomb rulers
• Cyclic difference sets
• A Construction of Codebooks Associated With Binary Sequences
• An Introduction to Frames
• Achieving the Welch Bound With Difference Sets
• Complex Codebooks From Combinatorial Designs
• A Generic Construction of Complex Codebooks Meeting the Welch Bound
• Complex sequences with low periodic correlations (Corresp.)
• Lower bounds on the maximum cross correlation of signals (Corresp.)
• A class of balanced binary sequences with optimal autocorrelation properties
• Almost difference sets and their sequences with optimal autocorrelation
• Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
• Symmetric informationally complete quantum measurements
• Two Classes of Codebooks Nearly Meeting the Welch Bound
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization

This page was built for publication: A new class of near-optimal partial Fourier codebooks from an almost difference set