Construction of cyclotomic codebooks nearly meeting the Welch bound

Authors:
Aixian Zhang;Keqin Feng
Affiliations:
School of Mathematical Science, Capital Normal University, Beijing, China 100048;Department of Mathematical Science, Tsinghua University, Beijing, China 100084
Venue:
Designs, Codes and Cryptography
Year:
2012

Citing 4
Cited 0

Almost difference sets and their sequences with optimal autocorrelation

IEEE Transactions on Information Theory
A new family of almost difference sets and some necessary conditions

IEEE Transactions on Information Theory
Complex Codebooks From Combinatorial Designs

IEEE Transactions on Information Theory
A Generic Construction of Complex Codebooks Meeting the Welch Bound

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ding and Feng (IEEE Trans Inform Theory 52(9):4229---4235, 2006, IEEE Trans Inform Theory 53(11):4245---4250, 2007) constructed series of (N, K) codebooks which meet or nearly meet the Welch bound $${\sqrt{\frac{N-K}{(N-1)K}}}$$ by using difference set (DS) or almost difference set (ADS) in certain finite abelian group respectively. In this paper, we generalize the cyclotomic constructions considered in (IEEE Trans Inform Theory 52(9):4229---4235, 2006, IEEE Trans Inform Theory 53(11):4245---4250, 2007) and (IEEE Trans Inform Theory 52(5), 2052---2061, 2006) to present more series of codebooks which nearly meet the Welch bound under looser conditions than ones required by DS and ADS.