Bounds on Codes Derived by Counting Components in Varshamov Graphs

We are interested in improving the Varshamov bound for finite values of length n and minimum distance d. We employ a counting lemma to this end which we find particularly useful in relation to Varshamov graphs. Since a Varshamov graph consists of components corresponding to low weight vectors in the cosets of a code it is a useful tool when trying to improve the estimates involved in the Varshamov bound. We consider how the graph can be iteratively constructed and using our observations are able to achieve a reduction in the over-counting which occurs. This tightens the lower bound for any choice of parameters n, k, d or q and is not dependent on information such as the weight distribution of a code. This work is taken from the author’s thesis [10]     

Co-Orthogonal Codes

We define, construct and sketch possible applications of a new class of non-linear codes: co-orthogonal codes, with possible applications in cryptography and parallel processing. We also describe a fast and general method for generating (non-linear) codes with prescribed dot-products with the help of multi-linear polynomials.     

A bivariate mixed policy for a simple repairable system based on preventive repair and failure repair

In this paper, a simple repairable system (i.e. a one-component repairable system with one repairman) with preventive repair and failure repair is studied. Assume that the preventive repair is adopted before the system fails, when the system reliability drops to an undetermined constant R  , the work will be interrupted and the preventive repair is executed at once. And assume that the preventive repair of the system is “as good as new” while the failure repair of the system is not, and the deterioration of the system is stochastic. Under these assumptions, by using geometric process, we present a bivariate mixed policy (R,N)$(R\text{,}N)$, respectively based on a scale of the system reliability and the failure-number of the system. Our aim is to determine an optimal mixed policy (R,N)^∗$(R\text{,}N{)}^{\ast }$ such that the long-run average cost per unit time (i.e. the average cost rate) is minimized. The explicit expression of the average cost rate is derived, and the corresponding optimal mixed policy can be determined analytically or numerically. Finally, a numerical example is given where the working time of the system yields a Weibull distribution. Some comparisons with a certain existing policy are also discussed by numerical methods.     

How to Mask the Structure of Codes for a Cryptographic Use

In this paper we show how to strengthen public-key cryptosystems against known attacks, together with the reduction of the public-key. We use properties of subcodes to mask the structure of the codes used by the conceiver of the system. We propose new parameters for the cryptosystems and even a modified Niederreiter cryptosystem in the case of Gabidulin codes, with a public-key size of less than 4000 bits.Communicated by: P. WildAMS Classification: 11T71     

Geometric criteria for the nonexistence of cycles in Gause-type predator-prey systems

The global stability of a multi-species interacting system has apparently important biological implications. In this paper we study the global stability of Gause-type predator-prey models by providing new criteria for the nonexistence of cycles and limit cycles. Our criteria have clear geometrical interpretations and are easier to apply than other methods employed in recent studies. Using these criteria and related techniques we are able to develop new results on the existence and uniqueness of cycles in Gause-type models with various growth and response functions.

     

Gold codes,Hadamard partitions and the security of CDMA systems

Let V = {1, 2, . . . , M} and let be a set of Hadamard matrices with the property that the magnitude of the dot product of any two rows of distinct matrices is bounded above. A Hadamard partition is any partition of the set of all rows of the matrices H _i into Hadamard matrices. Such partitions have an application to the security of quasi-synchronous code-division multiple-access radio systems when loosely synchronized (LS) codes are used as spreading codes. A new generation of LS code can be used for each information bit to be spread. For each generation, a Hadamard matrix from some partition is selected for use in the code construction. This code evolution increases security against eavesdropping and jamming. One security aspect requires that the number of Hadamard partitions be large. Thus the number of partitions is studied here. If a Kerdock code construction is used for the set of matrices, the Hadamard partition constructed is shown to be unique. It is also shown here that this is not the case if a Gold (or Gold-like) code construction is used. In this case the number of Hadamard partitions can be enumerated, and is very large.      

On the upper bounds of the minimum number of rows of disjunct matrices

A 0-1 matrix is d-disjunct if no column is covered by the union of any d other columns. A 0-1 matrix is (d; z)-disjunct if for any column C and any d other columns, there exist at least z rows such that each of them has value 1 at column C and value 0 at all the other d columns. Let t(d, n) and t(d, n; z) denote the minimum number of rows required by a d-disjunct matrix and a (d; z)-disjunct matrix with n columns, respectively. We give a very short proof for the currently best upper bound on t(d, n). We also generalize our method to obtain a new upper bound on t(d, n; z). The work of Y. Cheng and G. Lin is supported by Natural Science and Engineering Research Council (NSERC) of Canada, and the Alberta Ingenuity Center for Machine Learning (AICML) at the University of Alberta. The work of D.-Z. Du is partially supported by National Science Foundation under grant No.CCF0621829.     

Weighted weak type inequalities for modified Hardy operators and geometric means operators in dimensions one and greater

We characterize the pairs of weights (u,v) such that the geometric mean operator G₁, defined for positive functions f on (0,∞) by

     

Non-interactive geometric probing: Reconstructing non-convex polygons

We address the problem of characterizing polygonal shapes that can be reconstructed from a class of scanners that have asymmetric resolution. We approach this problem using the methodology of non-interactive probing.

Laser raster scanners provide very high precision along the direction of a scan, but it is not practical to place scans very close to each other. A system capable of generating an omni-directional scan pattern can make a series of directional measurements sufficient to permit the reconstruction of a scanned polygon based on the position of edge crossings and the path of the scanning beam between edge crossings. We provide a procedure to reconstruct a polygon from such a data set, as well as a characterization of the shapes that can be reconstructed given a particular scan density. Our system applies to both concave and convex polygons, as well as to polygons containing holes.