نتایج جستجو برای: orthogonal arrays of particle

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

Journal: :IEEE Transactions on Information Theory 2006

Journal: :J. Systems Science & Complexity 2006
Yingshan Zhang Weiguo Li Shisong Mao Zhongguo Zheng

In this article, we propose a new general approach to constructing asymmetrical orthogonal arrays, namely the Kronecker sum. It is interesting since a lot of new mixed-level orthogonal arrays can be obtained by this method.

Journal: :Designs, Codes and Cryptography 2022

It is known that correlation-immune (CI) Boolean functions used in the framework of side-channel attacks need to have low Hamming weights. The supports CI are (equivalently) simple orthogonal arrays when their elements written as rows an array. minimum weight a function then same number In this paper, we use Rao's Bound give sufficient condition on rows, for binary array (OA) be simple. We appl...

2011
Ryoh Fuji-Hara Ying Miao

A multi-structured design is a block design whose blocks have further structure like partitions, orders, arrays, etc. This problem have strong relationship to combinatorial arrays like orthogonal arrays, balanced arrays, and also many types of sequence problems, optical orthogonal codes, frequency hopping sequences, comma-free codes, etc. There are many different names of block designs which ha...

2004
A. Shaulov

We report a transducer structure tha t combines two orthogonal phased arrays which enable the real-time scanning of two orthogonal sectors. This biplane phased array is formed by partially dicing the opposite faces of a composite piezoelectric plate in orthogonal directions. Individual elements of the orthogonal arrays show broad radiation patterns close to the theoretical expectations for isol...

Journal: :IJMOR 2010
Mohamed H. Gadallah

Branch and Bound method. This method is based on integration of orthogonal arrays and enumeration based techniques. Several observations are given supplemented with simple model solutions to verify our assumptions. The modified algorithm is valid for higher dimensional problems. The algorithm employs several 2-levels orthogonal arrays and the complexity of solutions is always of the order n 2. ...

Journal: :IACR Cryptology ePrint Archive 2017
Douglas R. Stinson

In 1996, Jackson and Martin [10] proved that a strong ideal ramp scheme is equivalent to an orthogonal array. However, there was no good characterization of ideal ramp schemes that are not strong. Here we show the equivalence of ideal ramp schemes to a new variant of orthogonal arrays that we term augmented orthogonal arrays. We give some constructions for these new kinds of arrays, and, as a c...

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

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