Results 211 to 220 of about 1,211,632 (235)

Balanced ternary designs with block size four

Journal of Statistical Planning and Inference, 1993
A \(\text{BTD}(v,\rho_ 2,4,\lambda)\) is a balanced ternary design such that \(k=4\) and each element occurs two times in \(\rho_ 2\) blocks (and, of course, each pair of distinct elements occurs \(\lambda\) times in a block). A necessary existence condition for such a BTD is: if \(\lambda=2\) then \(v \geq 5 \rho_ 2+1\), if \(\lambda=3\) then \(v \geq
Billington, Elizabeth J., Khodkar, A., Mahmoodian, E. S.   +2 more
openaire   +4 more sources

Counting balanced ternary designs

Ars Comb., 1998
The paper concerns balanced incomplete block designs on \(v\) elements with blocks of size 3, where each pair of distinct elements is in two blocks. Furthermore, each element occurs singly in \(\rho _1\) blocks and doubly in \(\rho _2\) blocks. Every possible 3-block configuration corresponds to one of 65 templates, and the paper contains formulae that
Margaret Ann Francel, David J. John
openaire   +2 more sources

A note on partially balanced ternary designs

Periodica Mathematica Hungarica, 1988
\textit{S. K. Mehta}, \textit{S. K. Agrawal} and \textit{A. K. Nigam} [Sankhyā, Ser. B 37, 211-219 (1975; Zbl 0382.05013)] have introduced partially balanced ternary designs and have given two methods of their construction. One from the incidence matrix of a PBIB design and another by multiplying the incidence matrix of a BIB design.
openaire   +1 more source

Construction of Balanced Ternary Designs with Nested Rows and Columns Using BIB Designs

Calcutta Statistical Association Bulletin, 1998
Balanced ternary designs with nested rows and columns have been constructed using balanced incomplete block designs.
Tyagi, B. N., Rizwi, S. K.
openaire   +1 more source

One and two-block configurations in balanced ternary designs

Ars Comb., 1998
The paper concerns balanced ternary designs on \(v\) elements with blocks of size 3, where each pair of distinct elements is in two blocks. Furthermore, each element occurs singly in \(\rho _1\) blocks and doubly in \(\rho _2\) blocks. Every possible 2-block configuration corresponds to one of 11 templates, and the paper contains formulae that express ...
Margaret Ann Francel, Dinesh G. Sarvate
openaire   +2 more sources

A new class of partially balanced ternary designs

1988
Construction of partially balanced ternary designs have been considered by \textit{S. Mehta, S. K. Agarwal} and \textit{A. K. Nigam}, Sankhya, Ser. B 37, 211-219 (1975; Zbl 0382.05013) and \textit{K. Sinha} and \textit{G. M. Saha}, Biom. J. 21, 767-772 (1979; Zbl 0424.62053). Here, a method of construction of these designs has been described.
PATWARDHAN, GA, SHARMA, S
openaire   +1 more source

Note on parameters of balanced ternary designs

Australas. J Comb., 1995
In a balanced (binary) block design with constant block size (with the usual parameters \(v,k, \lambda\) fixed) the replication number \((r)\) must be constant. However, if \(v,r\) and \(\lambda\) are fixed, the block size does not have to be constant. \textit{W. D. Wallis} [Australas. J. Comb.
openaire   +2 more sources

Design of Memristor‐Based Balanced Ternary Full Adder

International Journal of Circuit Theory and Applications
ABSTRACT Balanced ternary digital logic circuits are designed based on memristors and applied to realize adder circuits, which can alleviate the Von Neumann architecture bottleneck and help extend Moore's Law. Four design methods are presented: decoder‐based method, multiplexer‐based method, method of combining multiplexers with ...
Xiao‐Yuan Wang, Chuan‐Tao Dong, Jiang‐Tao Huang, Hang Li, Herbert Ho‐Ching Iu, Sung‐Mo Kang   +5 more
openaire   +1 more source

Design of Balanced Ternary Encoder and Decoder

2022 6th International Conference on Computing Methodologies and Communication (ICCMC), 2022
Aadarsh G. Goenka, Shyamali Mitra, Nibaran Das   +2 more
openaire   +1 more source

Balanced ternary designs from any \((v, b, r, k)\) design

Ars Comb., 1999
For a block of a \((v,b,r,k)\)-design consider sets of size \(v-1\) that contain the block. There are \(v-k\) such sets, and for each of them consider \(v-1\) multisets in which one point is counted twice. In this way one gets \(b(v-1)(v-k)=v(b-r)(v-1)\) multisets, and it turns out that when these multisets are regarded as blocks, they form a \((V,B,R ...
G. Ram Kherwa, Jagdish Prasad, Bhagwandas   +2 more
openaire   +2 more sources