A Note on the Parameters of PBIB Association Schemes
نویسنده
چکیده
منابع مشابه
Construction of Rectangular Pbib Designs
In this paper, some methods of constructing rectangular PBIB design are presented using the incidence matrix of a known PBIB design and Hadanard matrix. The rectangular design so constructed has nice block structure properties. The dual of these rectangular designs generate semiregular GD designs. A rectangular design is also constructed by using treatments arranged in n square array. Dual of t...
متن کاملCalculation of Complicated Flows, Using First and Second-Order Schemes (RESEARCH NOTE)
The first-order schemes used for discretisation of the convective terms are straightforward and easy to use, with the drawback of introducing numerical diffusion. Application of the secondorder schemes, such as QUICK scheme, is a treatment to reduce the numerical diffusion, but increasing convergence oscillation is unavoidable. The technique used in this study is a compromise between the above-...
متن کاملOn construction of partially balanced n-ary designs
A new method of constructing a series of partially balanced ternary (PBT) designs is presented. In the method, we have added the corresponding rows of incidence matrices of a BIB design and a PBIB design, both obtained from single initial block with at least one element in common between them. The BIB and PBIB designs above were obtained by method of differences. We have also constructed PBT de...
متن کاملM1, M2, ..., Mk/G1, G2,..., Gk/l/N Queue with Buffer Division and Push-Out Schemes for ATM Networks (RESEARCH NOTE)
In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...
متن کاملOptimal (2, n) visual cryptographic schemes
In (2, n) visual cryptographic schemes, a secret image(text or picture) is encrypted into n shares which are distributed among n participants. The image cannot be decoded from any single share but any two participants can together decode it visually, without using any complex decoding mechanism. In this paper, we introduce three meaningful optimality criteria for evaluating different schemes an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013