نتایج جستجو برای: full exponent

تعداد نتایج: 314548  

Journal: :Australasian J. Combinatorics 1993
Warwick de Launey

In 1867, Syvlester noted that the Kronecker product of two Hadamard matrices is an Hadamard matrix. This gave a way to obtain an Hadamard matrix of exponent four from two of exponent two. Early last decade, Agayan and Sarukhanyan found a way to combine two Hadamard matrices of exponent two to obtain one of exponent three, and just last year Craigen, Seberry and Zhang discovered how to combine f...

Journal: :Bulletin of the Australian Mathematical Society 1975

Journal: :IACR Cryptology ePrint Archive 2017
Daniel J. Bernstein Joachim Breitner Daniel Genkin Leon Groot Bruinderink Nadia Heninger Tanja Lange Christine van Vredendaal Yuval Yarom

It is well known that constant-time implementations of modular exponentiation cannot use sliding windows. However, software libraries such as Libgcrypt, used by GnuPG, continue to use sliding windows. It is widely believed that, even if the complete pattern of squarings and multiplications is observed through a side-channel attack, the number of exponent bits leaked is not sufficient to carry o...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه ارومیه 1377

the methods which are used to analyze microstrip antennas, are divited into three categories: empirical methods, semi-empirical methods and full-wave analysis. empirical and semi-empirical methods are generally based on some fundamental simplifying assumptions about quality of surface current distribution and substrate thickness. thses simplificatioms cause low accuracy in field evaluation. ful...

Journal: :New Journal of Physics 2013

Journal: :Bulletin of the Australian Mathematical Society 1979

Journal: :Annales Polonici Mathematici 2003

2007
Marat V. Burnashev

|A new approach for getting upperbounds for the capacity and the error exponent of the Poisson channel is proposed. It is based on a new sphere{packing lowerbound for the error probability. Strong converse for the coding theorem is also established.

Journal: :CoRR 2017
Lan V. Truong Vincent Y. F. Tan

We derive upper and lower bounds on the reliability function for the common-message discrete memoryless broadcast channel with variable-length feedback. We show that the bounds are tight when the broadcast channel is stochastically degraded. For the achievability part, we adapt Yamamoto and Itoh’s coding scheme by controlling the expectation of the maximum of a set of stopping times. For the co...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید