Results 71 to 80 of about 85,957 (174)

Cavity Quantum Electrodynamics (CQED)-Based Quantum LDPC Encoders and Decoders

open access: yesIEEE Photonics Journal, 2011
Quantum information processing (QIP) relies on delicate superposition states that are sensitive to interactions with environment, resulting in errors. Moreover, the quantum gates are imperfect so that the use of quantum error correction coding (QECC) is ...
Ivan B. Djordjevic
doaj   +1 more source

Partially Balanced Incomplete Block Designs [PDF]

open access: yes, 1969
In balanced incomplete block designs, each pair of treatments is compared with equal precision, and each treatment is paired with every other treatment an equal number of times with in a common block; A is a constant for all treatments.
Shih, Yaw-Tarng
core   +1 more source

Resolvable designs with large blocks

open access: yes, 2007
Resolvable designs with two blocks per replicate are studied from an optimality perspective. Because in practice the number of replicates is typically less than the number of treatments, arguments can be based on the dual of the information matrix and ...
Morgan, J. P., Reck, Brian H.
core   +2 more sources

An Inequality for Balanced Incomplete Block Designs

open access: yesThe Annals of Mathematical Statistics, 1960
The inequality $b \geqq v + r - 1$ for a balanced incomplete block design was proved by Bose [1] under the assumption of resolvability. In this note the inequality is proved without that assumption, but with the weaker assumption that $v = nk$.
openaire   +2 more sources

High-Speed Visible Light Indoor Networks Based on Optical Orthogonal Codes and Combinatorial Designs

open access: yes, 2013
Interconnecting devices in an indoor environment using the illumination system and white light emitting diodes (LED) requires adaptive networking techniques that can provide network access for multiple users.
Brandt-Pearce, Maite, Noshad, Mohammad
core   +1 more source

Recursive Construction of Resolvable Nested Block Designs

open access: yesMathematics
This paper proposes a recursive method for constructing intra-resolvable balanced incomplete block designs (BIBDs). The approach exploits the algebraic and geometric structure of finite projective geometries over Galois fields to generate resolvable ...
Tariq S. Alshammari   +4 more
doaj   +1 more source

Optimal two-level conjoint designs for large numbers of attributes. [PDF]

open access: yes
In this paper, we propose a simple strategy to construct D-, A-, G- and V-optimal two-level multi-attribute designs for rating-based conjoint studies. Our approach combines orthogonal designs and balanced or partially balanced incomplete block designs ...
Goos, P   +2 more
core  

A Note on Balanced Incomplete Block Designs

open access: yesThe Annals of Mathematical Statistics, 1969
Summary: The author studies balanced incomplete block designs (BIBD) in which the blocks are not necessarily distinct. He proves the following Theorem. Let \(\mathcal D\) be a BIBD with parameters \(v,b,r,k,\lambda\). If \(s\) blocks of \(\mathcal D\) are identical and if \(r>\lambda\), then \(r/k=b/v\ge s\). The theorem implies the results of E.
openaire   +2 more sources

An Inequality for Balanced Incomplete Block Designs

open access: yesThe Annals of Mathematical Statistics, 1961
For a resolvable balanced incomplete block design, R. C. Bose [1] obtained the inequality $b \geqq v + r - 1$, and P. M. Roy [2] and W. F. Mikhail [3] proved this inequality without the assumption of resolvability, but with the weaker assumption that $v$ is a multiple of $k$. In this note an alternative and simpler proof of Roy's theorem is given.
openaire   +2 more sources

Алгоритм оцінки параметрів оптимальних ключових структур, побудованих на основі неповних урівноважених блок-схем [PDF]

open access: yes, 2003
Проведено дослідження ефективності (за показниками стійкості та кількості ключів, що має кожний кореспондент) структур мереж засекреченого зв’язку, побудованих на основі неповних урівноважених блок-схем.
Конюшок, Сергій
core  

Home - About - Disclaimer - Privacy