Finite Projective Geometries and Classification of the Weight Hierarchies of Codes （Ⅰ）

The weight hierarchy of a binary linear [n,κ] code C is the sequence (d1,d2,...,dκ), where dr is the smallest support of an r-dimensional subcode of C. The codes of dimension 4 are collected in classes and the possible weight hierarchies in each class is determined by finite projective geometries.The possible weight hierarchies in class A, B, C, D are determined in Part (Ⅰ). The possible weight hierarchies in class E, F, G, H, I are determined in Part (Ⅱ).     

Hypercubic 4 and 5-Designs from Double-Error-Correcting BCH Codes

An ordered orthogonal array OOA(, k, n) is a binary 2 ^k × n matrix with the property that for each complete -set of columns, each possible -tuple occurs in exactly 2 ^k– rows of those columns (for definition of a complete -set, see below). Constructions of OOA(, k, n) for = 4 and = 5 are given.     

The modular n-queen problem II

We study classes of solutions to the modular n-queen problem. The main part of the paper is concerned with symmetric solutions (solutions invariant under 90° rotation). In the last section we study maximal partial solutions for those values of n for which no solutions exist.     

The weight distribution of irreducible cyclic codes with block lengths n1((q1−1)N)

We study the weight distribution of irreducible cyclic (n, k) codeswith block lengths n = n₁((q¹ ? 1)/N), where N|q ? 1, gcd(n₁,N) = 1, and gcd(l,N) = 1. We present the weight enumerator polynomial, A(z), when k = n₁l, k = (n₁ ? 1)l, and k = 2l. We also show how to find A(z) in general by studying the generator matrix of an (n₁, m) linear code, $\text{V}{}^1{}_{\mathrm{d}}$ over GF(q^d) where d = gcd (ord_n1(q), l). Specifically we study A(z) when $\text{V}{}^1{}_{\mathrm{d}}$ is a maximum distance separable code, a maximal shiftregister code, and a semiprimitive code. We tabulate some numbers A_μ which completely determine the weight distributionof any irreducible cyclic (n₁(2¹ ? 1), k) code over GF(2) for all n₁ ? 17.     

Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets

The Welch lower bound on the total-squared-correlation (TSC) of binary signature sets is loose for binary signature sets whose length L is not a multiple of 4. Recently Karystinos and Pados [6,7] developed new bounds that are better than the Welch bound in those cases, and showed how to achieve the bounds with modified Hadamard matrices except in a couple of cases. In this paper, we study the open cases.     

The modular n-queen problem

We show that the modular n-queen problem has a solution if and only if gcd(n, 6) = 1. We give a class of solutions for all these n.     

Representations of integers as sums of powers with increasing exponents — II

This paper describes some computations and conjectures concerning the representation of integers as sums of powers.