Results 31 to 40 of about 4,474,845 (304)
Two New Classes of Codebooks Asymptotically Achieving the Welch Bound
IEEE Access, 2021 Exponential sums over Galois rings have many applications in coding theory, cryptography and algebraic combinatorics. In this article, we employ additive characters and multiplicative characters over Galois rings to present two classes of codebooks, and ...
Shimin Sun, Li Han, Yang Yan, Yao Yao
doaj +1 more source
Asymptotic optimality of sequential designs for estimation
International Journal of Mathematics and Mathematical Sciences, 1995 This paper is concerned with the problem of allocating a fixed number of trials between K independent populations from the exponential family, in order to estimate a linear combination of the means with squared error loss.
Kamel Rekab
doaj +1 more source
Asymptotic optimality of twist-untwist protocols for Heisenberg scaling in atom-based sensing
Physical Review Research, 2022 Twist-untwist protocols for quantum metrology consist of a serial application of (1) unitary nonlinear dynamics (e.g., spin squeezing or Kerr nonlinearity), (2) parameterized dynamics U(ϕ) (e.g., a collective rotation or phase space displacement), and (3)
T. J. Volkoff, Michael J. Martin
doaj +1 more source
Asymptotically Optimal Codebooks Derived From Generalised Bent Functions
IEEE Access, 2020 Codebooks are required to have small inner-product correlation in many practical applications, such as direct spread code division multiple access communications, space-time codes and compressed sensing.
Qiuyan Wang, Yang Yan
doaj +1 more source
Asymptotically Optimal Covering Designs
Journal of Combinatorial Theory, Series A, 1996 A (v,k,t) covering design, or covering, is a family of k-subsets, called blocks, chosen from a v-set, such that each t-subset is contained in at least one of the blocks. The number of blocks is the covering's size}, and the minimum size of such a covering is denoted by C(v,k,t).
Gordon, Daniel +3 more
openaire +3 more sources
Asymptotic optimal tracking: feedback strategies [PDF]
Stochastics, 2017 This is a companion paper to (Cai, Rosenbaum and Tankov, Asymptotic lower bounds for optimal tracking: a linear programming approach, arXiv:1510.04295). We consider a class of strategies of feedback form for the problem of tracking and study their performance under the asymptotic framework of the above reference.
Cai, Jiatu +2 more
openaire +2 more sources
Austrian Journal of Statistics, 2015 In the context of clinical trials for comparing two treatments, a new class of covariate adjusted response adaptive procedures is developed to achieve a balance between clinical optimality and inferential precision.
Rahul Bhattacharya, Uttam Bandyopadhyay
doaj +1 more source
Asymptotically Optimal Agents [PDF]
, 2011 21 LaTeX ...
Lattimore, Tor, Hutter, Marcus
openaire +2 more sources
Asymptotically Optimal Topological Quantum Compiling [PDF]
Physical Review Letters, 2014 In a topological quantum computer, universality is achieved by braiding and quantum information is natively protected from small local errors. We address the problem of compiling single-qubit quantum operations into braid representations for non-abelian quasiparticles described by the Fibonacci anyon model.
Kliuchnikov, Vadym +2 more
openaire +3 more sources
The Scientific World Journal, 2014 We address the scheduling problem for a no-wait flow shop to optimize total completion time with release dates. With the tool of asymptotic analysis, we prove that the objective values of two SPTA-based algorithms converge to the optimal value for ...
Tao Ren +4 more
doaj +1 more source