Codebooks from almost difference sets
type: Item
instance of: scholarly article
title: Codebooks from almost difference sets
zbMATH Open document ID: 1178.94010
author: Cunsheng Ding
author: Tao Feng
published in: Designs, Codes and Cryptography
publication date: 2009-03-31T00:00:00Z
Mathematics Subject Classification ID: 94A05
Mathematics Subject Classification ID: 05B10
zbMATH DE Number: 5536698
MaRDI profile type: Publication
full work available at URL: s10623-007-9140-z
OpenAlex ID: W1971917606
cites work: Almost difference sets and their sequences with optimal autocorrelation
cites work: Cyclic difference sets
cites work: Q4718790
cites work: Z4 -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
cites work: Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
cites work: Spherical codes and designs
cites work: Autocorrelation values of generalized cyclotomic sequences of order two
cites work: Complex Codebooks From Combinatorial Designs
cites work: A Generic Construction of Complex Codebooks Meeting the Welch Bound
cites work: Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets
cites work: New families of binary sequences with optimal three-level autocorrelation
cites work: A family of skew Hadamard difference sets
cites work: A class of balanced binary sequences with optimal autocorrelation properties
cites work: Grassmannian beamforming for multiple-input multiple-output wireless systems
cites work: Q4858432
cites work: Finite geometry and character theory
cites work: Q4330648
cites work: Q4330645
cites work: Grassmannian frames with applications to coding and communication
cites work: Lower bounds on the maximum cross correlation of signals (Corresp.)
cites work: A family of difference sets
cites work: Achieving the Welch Bound With Difference Sets
cites work: Q4934424
DOI: 10.1007/S10623-007-9140-Z
description: scientific article; zbMATH DE number 5536698