High-Definition (HD) videos often contain rich details as well as large homogeneous regions. To exploit such a property, Variable Block-size Transforms (VBT) should be in place so that transform block size can adapt to local activities. In this paper, we propose a 16×16 Integer Cosine Transform (ICT) for HD video coding, which is simple and efficient. This 16×16 ICT is integrated into the AVS Z...

We give a construction for a new family of Group Divisible Designs (6s+ 2, 3, 4; 1, 2) using Mutually Orthogonal Latin Squares for all positive integers s. Consequently, we have proved that the necessary conditions are sufficient for the existence of GDD’s of block size four with three groups, λ1=2 and λ2=1.

Because the stationary bootstrap resamples data blocks of random length, this method has been thought to have the largest asymptotic variance among block bootstraps Lahiri [Ann. Statist. 27 (1999) 386–404]. It is shown here that the variance of the stationary bootstrap surprisingly matches that of a block bootstrap based on nonrandom, nonoverlapping blocks. This argument translates the variance...

In this paper, we examine a class of doubly resolvable combinatorial objects. Let t, k, λ, s and v be nonnegative integers, and let X be a set of v symbols. A generalized Howell design, denoted t-GHDk(s, v;λ), is an s × s array, each cell of which is either empty or contains a k-set of symbols from X, called a block, such that: (i) each symbol appears exactly once in each row and in each column...

Amongst resolvable incomplete block designs, affine resolvable designs are optimal in many conventional senses. However, different affine resolvable designs for the same numbers of treatments, replicates, and block size can differ in how well they estimate elementary treatment contrasts. An aberration criterion is employed to distinguish the best of the affine resolvable designs for this task. ...

Generalized Bhaskar Rao n-ary are defined. This paper studies with elements from abelian groups of Generalized Bhaskar Rao nary called Bhaskar Rao Bhaskar Rao a v b matrix of ±1 and such that the inner product of any two rows 0 and the matrix obtained of X by its absolute value the incidence matrix of the construction of infinite families of Balanced Balanced are Some construction methods and n...

We propose a new scheme for managing files of variable-length dynamic records, based on storing the records in large, fixed-length blocks. We demonstrate the effectiveness of this scheme for text indexing, showing that it achieves space utilisation of over 95%. With an appropriate block size and caching strategy, our scheme requires on average around two disk accesses—one read and one write—for...

Assaf, A.M., A. Hartman and N. Shalaby, Packing designs with block size 6 and index 5, Discrete Mathematics 103 (1992) 121-128. A (v, K, A) packing design of order v, block size K and index 1 is a collection of K-element subsets, called blocks, of a v-set V such that every 2-subset of V occurs in at most I blocks. The packing problem is to determine the maximum number of blocks in a packing des...

We investigate the spectrum for {4}-GDDs of type g u m 1. We determine, for each admissible pair (g, u) (with some exceptions), the maximum and minimum values of m for which a {4}-GDD of type g u m 1 exists.

A symmetric key encryption scheme is described for blocks of general size N that is a product of powers of many prime numbers. This is accomplished by realising each number (representing a message unit) as a point in a product of affine spaces over various finite fields. Then algebro-geometric transformations on those spaces is transported back to provide encryption. For a specific block size <...