Weight hierarchies of linear codes of dimension 3

The weight hierarchy of a linear [n,k;q] code C over GF(q) is the sequence (d₁,d₂,…,d_k), where d_r is the smallest support of an r-dimensional subcode of C. The weight hierarchies of [n,3;q] codes are studied. In particular, for q⩽5 the possible weight hierarchies of [n,3;q] codes are determined.     

Flocks and partial flocks of quadrics: a survey

If O is an ovoid of PG(3,q), then a partition of all but two points of O into q−1 disjoint ovals is called a flock of O. A partition of a nonsingular hyperbolic quadric Q⁺(3,q) into q+1 disjoint irreducible conics is called a flock of Q⁺(3,q). Further, if O is either an oval or a hyperoval of PG(2,q) and if K is the cone with vertex a point x of PG(3,q)⧹PG(2,q) and base O, then a partition of K⧹{x} into q disjoint ovals or hyperovals in the respective cases is called a flock of K. The theory of flocks has applications to projective planes, generalized quadrangles, hyperovals, inversive planes; using flocks new translation planes, hyperovals and generalized quadrangles were discovered. Let Q be an elliptic quadric, a hyperbolic quadric or a quadratic cone of PG(3,q). A partial flock of Q is a set P consisting of β disjoint irreducible conics of Q. Partial flocks which are no flocks, have applications to k-arcs of PG(2,q), to translation planes and to partial line spreads of PG(3,q). Recently, the definition and many properties of flocks of quadratic cones in PG(3,q) were generalized to partial flocks of quadratic cones with vertex a point in PG(n,q), for n⩾3 odd.     

The q-Bernstein basis as a q-binomial distribution

The q-Bernstein basis, used in the definition of the q-Bernstein polynomials, is shown to be the probability mass function of a q-binomial distribution. This distribution is defined on a sequence of zero–one Bernoulli trials with probability of failure at any trial increasing geometrically with the number of previous failures. A modification of this model, with the probability of failure at any trial decreasing geometrically with the number of previous failures, leads to a second q-binomial distribution that is also connected to the q-Bernstein polynomials. The q-factorial moments as well as the usual factorial moments of these distributions are derived. Further, the q-Bernstein polynomial B_n(f(t),q;x) is expressed as the expected value of the function f([X_n]_q/[n]_q) of the random variable X_n obeying the q-binomial distribution. Also, using the expression of the q-moments of X_n, an explicit expression of the q-Bernstein polynomial B_n(f_r(t),q;x), for f_r(t) a polynomial, is obtained.     

The number of solutions to the alternate matrix equation over a finite field and a q-identity

Let F_q be a finite field with q elements, where q is a power of a prime. In this paper, we first correct a counting error for the formula N(K_2ν,0^(m)) occurring in Carlitz (1954. Arch. Math. V, 19–31). Next, using the geometry of symplectic group over F_q, we have given the numbers of solutions X of rank k and solutions X to equation XAX′=B over F_q, where A and B are alternate matrices of order n, rank 2ν and order m, rank 2s, respectively. Finally, an elementary q-identity is obtained from N(K_2ν,0⁽⁰⁾), and the explicit results for N(K_n,2ν,K_m,2s) is represented by terminating q-hypergeometric series.     

Existence of certain class of duadic group algebra codes

Duadic codes are defined in terms of idempotents of a group algebra GF(q)G, where G is a finite group and gcd(q,|G|)=1. Under the conditions of (1) q=2^m, and (2) the idempotents are taken to be central and (3) the splitting is μ₋₁, we show that such duadic codes exist if and only if q has odd-order modulo |G|.     

Partitioned difference families and almost difference sets

Partitioned difference families (PDFs) were first studied by Ding and Yin in conjunction with the construction of constant composition codes (CCCs). In 2008, Yin et al. presented the constructions of a number of infinite classes of PDFs based on known difference sets in GF(q). In this paper, we further investigate the constructions of PDFs by using known almost difference sets in GF(q), and establish some recursive constructions of PDFs. As their applications, we also get a number of perfect difference systems of sets (DSSs) over Z_q² with q odd prime.     

Comparison of rotatable designs for regression on balls,I (quadratic)

Designs for quadratic and cubic regression are considered when the possible choices of the controlable variable are points x=( x₁,x₂,…,x_q) in the q-dimensional. Full of radius R, B_q(R) ={x:Σ⁴_ix²_i?R²}. The designs that are optimum among rotatable designs with respect to the D-, A-, and E-optimality criteria are compared in their performance relative to these and other criteria, including extrapolation. Additionally, the performance of a design optimum for one value of R, when it is implemented for a different value of R, is investigated. Some of the results are developed algebraically; others, numerically. For example, in quadratic regression the A-optimum design appears to be fairly robust in its efficiency, under variation of criterion.     

A construction for generalized hadamard matrices GH(4q, EA(q))

We give a construction for a generalized Hadamard matrix GH(4q, EA(q)) as a 4 × 4 matrix of q × q blocks, for q an odd prime power other than 3 or 5. Each block is a GH(q, EA(q)) and certain combinations of 4 blocks form GH(2q, EA(q)) matrices. Hence a GH(4q, EA(q)) matrix exists for every prime power q.     

Fast nonparametric classification based on data depth

A new procedure, called D D α-procedure, is developed to solve the problem of classifying d-dimensional objects into q ≥ 2 classes. The procedure is nonparametric; it uses q-dimensional depth plots and a very efficient algorithm for discrimination analysis in the depth space [0,1] ^q . Specifically, the depth is the zonoid depth, and the algorithm is the α-procedure. In case of more than two classes several binary classifications are performed and a majority rule is applied. Special treatments are discussed for ‘outsiders’, that is, data having zero depth vector. The D Dα-classifier is applied to simulated as well as real data, and the results are compared with those of similar procedures that have been recently proposed. In most cases the new procedure has comparable error rates, but is much faster than other classification approaches, including the support vector machine.     

Embedding of orthogonal arrays of strength two and deficiency greater than two

Let x ≥ 0 and n ≥ 2 be integers. Suppose there exists an orthogonal array $\text{A(n, q, μ}{}^1\text{)}$ of strength 2 in n symbols with q rows and $\text{n}{}^2\text{μ}{}^1$ columns where $\text{q = q}{}^1\text{? d, q}{}^1\text{= n}{}^2\text{x + n + 1}$, $\text{μ}{}^1\text{= (n ?}\text{1}\text{)x +}\text{1}$ and d is a positive integer. Then d is called the deficiency of the orthogonal array. The question of embedding such an array into a complete array $\text{A(n, q}{}^1\text{, μ}{}^1\text{)}$ is considered for the case d ≥ 3. It is shown that for d = 3 such an embedding is always possible if n ≥ 2(d ? 1)²(2d² ? 2d + 1). Partial results are indicated if d ≥ 4 for the embedding of a related design in a corresponding balanced incomplete block design.     

On the characteristic polynomial of the information matrix of balanced fractional sm factorial designs of resolution Vp,q

An explicit expression for the characteristic polynomial of the information matrix for a balanced fractional s^m factorial design of resolution V_{p, q} (in particular, when p = q = s − 1, of resolution V) is obtained by utilizing the decomposition of a multidimensional relationship algebra into its four two-sided ideals. Furthermore, by use of the algebraic structure of the underlying multidimensional relationship, the trace and the determinant of the covariance matrix of the estimates of effects to be interest are derived.     

Implications of survey design for generalized regression estimation of linear functions

The paper presents a general randomization theory approach to point and interval estimation of Q linear functions T_q = Σ^N₁c_kqY_k(q = 1,…,Q), where Y₁,…,Y_N are values of a variable of interest Y in a finite population. Such linear functions include population and domain means and totals, population regression coefficients, etc. We assume that some auxiliary information can be exploited. This suggests the generalized regression technique based on the fit of a linear model, whereby is created approximately design unbiased estimators T?_q. The paper focuses on estimation of the variance-covariance matrix of the T?_q for single stage and two stage designs. Two techniques based on Taylor expansions are compared. Results of Monte-Carlo experiments (not reported here) show that the coverage properties are good of normal-theory confidence intervals flowing from one or the other variance estimate.     

A Note on the Canonical Correlations From Contingency Tables

Explicit formulae are obtained for the asymptotic variances and covariances of canonical correlations which correspond to non-zero theoretical correlations in (p+ 1) x (q+1) contingency tables, with p≤q. The moments of the roots of a central Wishart matrix distributed as Wp(q; I ) are also given in general, with means, variances and covariances tabulated for p= 2, 3, 4: these may apply to canonical correlations corresponding to zeros.     

Minimal 2-coverings of a finite affine space based on GF(2)

Let EG(m, 2) denote the m-dimensional finite Euclidean space (or geometry) based on GF(2), the finite field with elements 0 and 1. Let T be a set of points in this space, then T is said to form a q-covering (where q is an integer satisfying 1?q?m) of EG(m, 2) if and only if T has a nonempty intersection with every (m-q)-flat of EG(m, 2). This problem first arose in the statistical context of factorial search designs where it is known to have very important and wide ranging applications. Evidently, it is also useful to study this from the purely combinatorial point of view. In this paper, certain fundamental studies have been made for the case when q=2. Let N denote the size of the set T. Given N, we study the maximal value of m.     

Construction of orthogonal Latin hypercube designs with flexible run sizes

Latin hypercube designs (LHDs) have recently found wide applications in computer experiments. A number of methods have been proposed to construct LHDs with orthogonality among main-effects. When second-order effects are present, it is desirable that an orthogonal LHD satisfies the property that the sum of elementwise products of any three columns (whether distinct or not) is 0. The orthogonal LHDs constructed by Ye (1998), Cioppa and Lucas (2007), Sun et al. (2009) and Georgiou (2009) all have this property. However, the run size n of any design in the former three references must be a power of two (n=2^c) or a power of two plus one (n=2^c+1), which is a rather severe restriction. In this paper, we construct orthogonal LHDs with more flexible run sizes which also have the property that the sum of elementwise product of any three columns is 0. Further, we compare the proposed designs with some existing orthogonal LHDs, and prove that any orthogonal LHD with this property, including the proposed orthogonal LHD, is optimal in the sense of having the minimum values of ave(|t|), t_max, ave(|q|) and q_max.     

Efficient estimates in linear and nonlinear regression with heteroscedastic errors

In this paper we consider the heteroscedastic regression model defined by the structural relation Y = r(V, β) + s(W)ε, where V is a p-dimensional random vector, W is a q-dimensional random vector, β is an unknown vector in some open subset B of R^m, r is a known function from R^p × B into R, s is an unknown function on R^q, and ε is an unobservable random variable that is independent of the pair (V, W). We construct asymptotically efficient estimates of the regression parameter β under mild assumptions on the functions r and s and on the distributions of ε and (V, W).     

Large sample theory of the Langevin distribution

The Langevin (or von Mises-Fisher) distribution of random vector x on the unit sphere ω_q in $\text{R}$^q has a density proportional to exp κμ'x where μ'x is the scalar product of x with the unit modal vector μ and κ?0 is a concentration parameter. This paper studies estimation and tests for a wide variety of situations when the sample sizes are large. Geometrically simple test statistics are given for many sample problems even when the populations may have unequal concentration parameters.     

Analysing truncated data with semiparametric transformation models

Left-truncation often arises when patient information, such as time of diagnosis, is gathered retrospectively. In some cases, the distribution function, say G(x), of left-truncated variables can be parameterized as G(x; θ), where θ∈Θ?R^q and θ is a q-dimensional vector. Under semiparametric transformation models, we demonstrated that the approach of Chen et al. (Semiparametric analysis of transformation models with censored data. Biometrika. 2002;89:659–668) can be used to analyse this type of data. The asymptotic properties of the proposed estimators are derived. A simulation study is conducted to investigate the performance of the proposed estimators.