Digital fingerprinting is a technique for identifying unauthorized copy and tracing back to its user. The distributor marks each individual copy with a unique fingerprint. The present fingerprinting schemes generally have many difficulties and disadvantages in the case of large-size users. In this paper, we present a new fingerprint scheme which can be used in confidential departments where the...

In this paper, we prove the existence of a cyclic (v, 4, 1)-BIBD for v = 12t + 4, 3 ≤ t ≤ 50 using computer programs, which are useful in recursive constructions for cyclic designs. Applications of these designs to optical orthogonal codes are also mentioned.

A design D consists of a family B1 , ..., Bb of subets, called blocks, of a finite set S=[P1 , ..., Pv] whose elements are called points or varieties. D is balanced or *-linked if every pair of points is contained in exactly * blocks. If, in addition, *>0 and no block contains all the points, then D is nontrivial, and if every block has the same cardinality k then D is a balanced incomplete-blo...

we investigate buchbaum and eisenbud's construction of the second symmetric power $s_r(x)$ of a chain complex $x$ of modules over a commutative ring $r$. we state and prove a number of results from the folklore of the subject for which we know of no good direct references. we also provide several explicit computations and examples. we use this construction to prove the following ...

The design (15,21,7,5,2) is the only BIBD of block size 5 that does not exist. If it did exist, it would provide an exact bicovering, in 21 blocks of size 5, of the pairs from 15 points. However, we show that 22 quintuples are sufficient to provide a bicover of the pairs from 15 points; thus there are only 10 repetitions required in the bicovering.

One of the main shortfall Balanced Incomplete Block Designs is that design not available for all parameter sets. Thus, some sets satisfy necessary conditions BIBD cannot be constructed as such. This means designs possible to with a single association scheme (λ). Given structural difference exist between and PBIBD later do have but rather m schemes, study believed if could associations then mayb...

ÐWe present a novel data organization for disk arraysÐSegmented Information Dispersal (SID). SID provides protection against disk failures while ensuring that the reconstruction of the missing data requires only relatively small contiguous accesses to the available disks. SID has a number of properties that make it an attractive solution for fault-tolerant video servers. Under fault-free condit...

A Kirkman square with index λ, latinicity μ, block size k, and v points, KSk(v; μ, λ), is a t × t array (t = λ(v − 1)/μ(k − 1)) defined on a v-set V such that (1) every point of V is contained in precisely μ cells of each row and column, (2) each cell of the array is either empty or contains a k-subset of V , and (3) the collection of blocks obtained from the non-empty cells of the array is a (...