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

DOI10.1007/S10623-012-9753-8MaRDI QIDQ2448090zbMATH OpenOpenAlexFDO

Authors Nam Yul Yu, Aixian Zhang, Keqin 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

almost difference setscodebooksframesmodular Golomb rulersWelch bound

Mathematics Subject Classification ID

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

Recommendations

• New nearly optimal codebooks from relative difference sets
• Codebooks from almost difference sets
• Two classes of near-optimal codebooks with respect to the Welch bound
• Optimal almost equisymbol codes based on difference matrices
• Nearly optimal codebooks based on generalized Jacobi sums
• A Construction of Minimal Linear Codes From Partial Difference Sets
• Two constructions of asymptotically optimal codebooks
• New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters
• A further construction of asymptotically optimal codebooks with multiplicative characters
• A nearly-optimal Fano-based coding algorithm

Cites work

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

Cited in

(5)

• Nearly optimal codebooks based on generalized Jacobi sums
• Two classes of near-optimal codebooks with respect to the Welch bound
• Two families of nearly optimal codebooks
• Partial Fourier codebooks associated with multiplied Golay complementary sequences for compressed sensing
• More constructions of near optimal codebooks associated with binary sequences

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

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