Results 31 to 40 of about 2,772 (191)

Fractional repetition codes with flexible repair from combinatorial designs [PDF]

open access: yes, 2016
Fractional repetition (FR) codes are a class of regenerating codes for distributed storage systems with an exact (table-based) repair process that is also uncoded, i.e., upon failure, a node is regenerated by simply downloading packets from the surviving
Olmez, Oktay   +2 more
core   +3 more sources

Coded Caching based on Combinatorial Designs

open access: yes, 2020
We consider the standard broadcast setup with a single server broadcasting information to a number of clients, each of which contains local storage (called \textit{cache}) of some size, which can store some parts of the available files at the server. The
Agrawal, Shailja   +2 more
core   +1 more source

Generalizations of results of Stanton on BIBDs

open access: yesDiscrete Mathematics, 1992
Characterization theorems using intersection numbers for designs made up by putting together \(n\) copies of a symmetric design are proved. For instance it is proved that if a design \(D\) on \(v\) points with block size \(k\) has the property that every block has \(n-1\) intersection numbers equal to \(k\) and the other \(b-n\) intersection numbers ...
Joseph Hammer, Dinesh G. Sarvate
openaire   +1 more source

On balanced incomplete block designs with specified weak chromatic number

open access: yes, 2013
A weak $c$-colouring of a balanced incomplete block design (BIBD) is a colouring of the points of the design with $c$ colours in such a way that no block of the design has all of its vertices receive the same colour.
Horsley, Daniel, Pike, David A.
core   +1 more source

Application of Expurgated PPM to Indoor Visible Light Communications - Part II: Access Networks

open access: yes, 2013
Providing network access for multiple users in a visible light communication (VLC) system that utilizes white light emitting diodes (LED) as sources requires new networking techniques adapted to the lighting features.
Brandt-Pearce, Maite, Noshad, Mohammad
core   +1 more source

Resolvable bibd and sols

open access: yesDiscrete Mathematics, 1983
AbstractThe ideas of a base factorization and a resolvable grid system are introduced, and a construction of a resolvable balanced incomplete block design (BIBD) from these structures is given. Resolvable grid systems can be constructed from mutually orthogonal self-orthogonal latin squares (SOLS) with symmetric mate. Together these results prove, as a
openaire   +1 more source

Quality assessment of an interferon-gamma release assay for tuberculosis infection in a resource-limited setting

open access: yesBMC Infectious Diseases, 2009
Background When a test for diagnosis of infectious diseases is introduced in a resource-limited setting, monitoring quality is a major concern. An optimized design of experiment and statistical models are required for this assessment.
Hang Nguyen TL   +10 more
doaj   +1 more source

COMPARATIVE STUDY ON AAOIFI FAS 1 AND IAS 1 AND EXPLORING THE COMPLIANCE OF AAOIFI FAS 1 FOR ISLAMIC FINANCIAL INSTITUTIONS (IFIS) IN BRUNEI AND UNITED ARAB EMIRATES (UAE)

open access: yesJournal of Business & Economic Analysis, 2023
This paper has two main objectives. First, it aims to compare the Accounting and Auditing Organization for Islamic Financial Institutions (AAOIFI) Financial Accounting Standard 1 (FAS 1) with International Accounting Standard 1 (IAS 1).
NORIZATUL AQILAH BINTI SAMRA   +1 more
doaj   +1 more source

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

A New Family of BIBD's

open access: yesThe Annals of Mathematical Statistics, 1971
Block designs with parameters $(p^n, \Delta p^n, \Delta((p^n - 1)/2), (p^n - 1)/2, \Delta((p^n - 3)/4))$ are shown to exist whenever $p^n$, a prime power, can be expressed as $2^mt + 1$ with $m$ a positive integer and $t$ an odd integer $>1$, that is, whenever $p^n$ is not one greater than a power of 2; $\Delta$ is equal to $2^{m-1}$.
openaire   +3 more sources

Home - About - Disclaimer - Privacy