A further construction of asymptotically optimal codebooks with multiplicative characters

2019 ◽  
Vol 30 (6) ◽  
pp. 453-469
Author(s):  
Wenjuan Yin ◽  
Can Xiang ◽  
Fang-Wei Fu
Keyword(s):  
Asymptotically Optimal ◽  
Multiplicative Characters

scholarly journals Four Constructions of Asymptotically Optimal Codebooks via Additive Characters and Multiplicative Characters

Mathematics ◽  
2019 ◽  
Vol 7 (12) ◽  
pp. 1144 ◽  
Author(s):  
Xia Wu ◽  
Wei Lu
Keyword(s):  
Cross Correlation ◽  
Irreducible Polynomials ◽  
Asymptotically Optimal ◽  
Welch Bound ◽  
Multiplicative Characters ◽  
Special Case

In this paper, we present four new constructions of complex codebooks with multiplicative characters, additive characters, and quadratic irreducible polynomials and determine the maximal cross-correlation amplitude of these codebooks. We prove that the codebooks we constructed are asymptotically optimal with respect to the Welch bound. Moreover, we generalize the result obtained by Zhang and Feng and contain theirs as a special case. The parameters of these codebooks are new.

scholarly journals Asymptotically optimal cubature formulas on manifolds for prefixed weights

2021 ◽  
pp. 105632
Author(s):  
Martin Ehler ◽  
Ujué Etayo ◽  
Bianca Gariboldi ◽  
Giacomo Gigante ◽  
Thomas Peter
Keyword(s):  
Asymptotically Optimal ◽  
Cubature Formulas

Large Families of Asymptotically Optimal Two-Dimensional Optical Orthogonal Codes

2012 ◽  
Vol 58 (2) ◽  
pp. 1163-1185 ◽  
Author(s):  
Reza Omrani ◽  
Gagan Garg ◽  
P. Vijay Kumar ◽  
Petros Elia ◽  
Pankaj Bhambhani
Keyword(s):  
Two Dimensional ◽  
Asymptotically Optimal ◽  
Optical Orthogonal Codes ◽  
Orthogonal Codes ◽  
Large Families

ON THE AVERAGE CASE CIRCUIT DELAY OF DISJUNCTION

1995 ◽  
Vol 05 (02) ◽  
pp. 275-280 ◽  
Author(s):  
BEATE BOLLIG ◽  
MARTIN HÜHNE ◽  
STEFAN PÖLT ◽  
PETR SAVICKÝ
Keyword(s):  
Lower Bounds ◽  
Wide Class ◽  
Time Complexity ◽  
Upper And Lower Bounds ◽  
Average Case ◽  
Asymptotically Optimal ◽  
Circuit Delay ◽  
Suitable Measure

For circuits the expected delay is a suitable measure for the average case time complexity. In this paper, new upper and lower bounds on the expected delay of circuits for disjunction and conjunction are derived. The circuits presented yield asymptotically optimal expected delay for a wide class of distributions on the inputs even when the parameters of the distribution are not known in advance.

An asymptotically optimal greedy algorithm for large optical burst switching systems

2003 ◽  
Vol 31 (2) ◽  
pp. 14-16 ◽  
Author(s):  
Lachlan L. H. Andrew ◽  
Yuliy Baryshnikov ◽  
E. G. Coffman ◽  
Stephen V. Hanly ◽  
Jolyon White
Keyword(s):  
Greedy Algorithm ◽  
Optical Burst Switching ◽  
Switching Systems ◽  
Asymptotically Optimal ◽  
Burst Switching ◽  
Optical Burst
Sign in / Sign up

Export Citation Format

Share Document