Sciweavers

2576 search results - page 30 / 516
» The Complexity of Zero Knowledge
Sort
View
TCOM
2010
80views more  TCOM 2010»
14 years 10 months ago
Near optimal training sequences for low complexity symbol timing estimation in MIMO systems
—Training sequences for data-aided timing estimation in multi-input multi-output systems are designed. It is observed that for low complexity implementation, the sequences must n...
Ketan Rajawat, Ajit K. Chaturvedi
ENTCS
2008
91views more  ENTCS 2008»
14 years 12 months ago
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...
Prashant Batra
GLOBECOM
2007
IEEE
15 years 6 months ago
Low PAPR STBCs from Complex Partial-Orthogonal Designs (CPODs)
— Space-time codes from complex orthogonal designs (CODs) with no zero entries offer low Peak to Average power ratio (PAPR) and avoid the problem of turning off antennas. But COD...
Gopu V. R. Muni Kumar, B. Sundar Rajan
AMC
2008
66views more  AMC 2008»
14 years 12 months ago
New third order nonlinear solvers for multiple roots
ct 7 Two third order methods for finding multiple zeros of nonlinear functions are developed. One method is based on 8 Chebyshev's third order scheme (for simple roots) and th...
B. Neta
CCR
2000
101views more  CCR 2000»
14 years 11 months ago
Knowledge-proof based versatile smart card verification protocol
We propose a zero-knowledge interactive proof based identification and signature scheme. The protocol is based on Euler's totient function and discrete logarithms over the ri...
Dae Hun Nyang, Joo-Seok Song