Results 11 to 20 of about 1,951,890 (275)
Quantum error detection .II. Bounds [PDF]
IEEE Transactions on Information Theory, 2000 In Part II we show that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive bounds on this exponent.The lower (existence) bound for stabilizer codes is proved by a counting argument for classical self-orthogonal quaternary codes.
Ashikhmin, Alexei E. +3 more
openaire +2 more sources
Error Bounds for Dynamical Spectral Estimation [PDF]
SIAM Journal on Mathematics of Data Science, 2021 34 pages, 7 ...
Robert J. Webber +4 more
openaire +4 more sources
Optimal Recovery of Missing Values for Non-Negative Matrix Factorization
IEEE Open Journal of Signal Processing, 2021 Missing values imputation is often evaluated on some similarity measure between actual and imputed data. However, it may be more meaningful to evaluate downstream algorithm performance after imputation than the imputation itself.
Rebecca Chen Dean, Lav R. Varshney
doaj +1 more source
Mathematics, 2023 In this research, we provide sufficient conditions to prove the existence of local and global solutions for the general two-dimensional nonlinear fractional integro-differential equations. Furthermore, we prove that these solutions are unique.
Tahereh Eftekhari, Jalil Rashidinia
doaj +1 more source
Street-Level Landmark Evaluation With Upper Error Bound
IEEE Access, 2019 Street-level landmarks are the basis of high-precision IP geolocation, and the location-error of landmark affects the accuracy of geolocation result. However, existing landmark evaluation methods cannot determine the error range of landmarks.
Wen Yang, Xiaonan Liu, Meijuan Yin
doaj +1 more source
A Novel Numerical Method for Computing Subdivision Depth of Quaternary Schemes
Mathematics, 2021 In this paper, an advanced computational technique has been presented to compute the error bounds and subdivision depth of quaternary subdivision schemes.
Aamir Shahzad +5 more
doaj +1 more source
Decoding Cyclic Codes up to a New Bound on the Minimum Distance [PDF]
, 2012 A new lower bound on the minimum distance of q-ary cyclic codes is proposed. This bound improves upon the Bose-Chaudhuri-Hocquenghem (BCH) bound and, for some codes, upon the Hartmann-Tzeng (HT) bound. Several Boston bounds are special cases of our bound.
Bezzateev, Sergey +2 more
core +2 more sources
Entropy, 2016 In this work, we propose a new approach of deriving the bounds between entropy and error from a joint distribution through an optimization means. The specific case study is given on binary classifications.
Bao-Gang Hu, Hong-Jie Xing
doaj +1 more source
On approximating the error function
Journal of Inequalities and Applications, 2016 In the article, we present the necessary and sufficient condition for the parameter p on the interval ( 7 / 5 , ∞ ) $(7/5, \infty)$ such that the function x → erf ( x ) / B p ( x ) $x\rightarrow\operatorname{erf}(x)/B_{p}(x)$ is strictly increasing ...
Zhen-Hang Yang, Yu-Ming Chu
doaj +1 more source