Intersections of q-ary perfect codes

The intersections of q-ary perfect codes are under study. We prove that there exist two q-ary perfect codes C ₁ and C ₂ of length N = qn + 1 such that |C ₁ ? C ₂| = k · |P _i |/p for each k ∈ {0,..., p · K ? 2, p · K}, where q = p ^r , p is prime, r ≥ 1, $n = \tfrac{{q^{m - 1} - 1}}{{q - 1}}$ , m ≥ 2, |P _i | = p ^nr(q?2)+n , and K = p ^{n(2r?1)?r(m?1)}. We show also that there exist two q-ary perfect codes of length N which are intersected by p ^nr(q?3)+n codewords.     

On diameter perfect constant-weight ternary codes

From cosets of binary Hamming codes we construct diameter perfect constant-weight ternary codes with weight n-1 (where n is the code length) and distances 3 and 5. The class of distance 5 codes has parameters unknown before.     

On the embedding of constant-weight codes into perfect codes

We show that each q-ary constant-weight code of weight 3, minimum distance 4, and length m embeds in a q-ary 1-perfect code of length n = (q ^m ? 1)/(q ? 1).     

Local duality theorem for q-ary 1-perfect codes

In this paper, we derive the relationship between local weight enumerator of q-ary 1-perfect code in a face and that in the orthogonal face. As an application of our result, we compute the local weight enumerators of a shortened, doubly-shortened, and triply-shortened q-ary 1-perfect code.     

Undetected error probability of q-ary constant weight codes

In this paper, we introduce a new combinatorial invariant called q-binomial moment for q-ary constant weight codes. We derive a lower bound on the q-binomial moments and introduce a new combinatorial structure called generalized (s, t)-designs which could achieve the lower bounds. Moreover, we employ the q-binomial moments to study the undetected error probability of q-ary constant weight codes. A lower bound on the undetected error probability for q-ary constant weight codes is obtained. This lower bound extends and unifies the related results of Abdel-Ghaffar for q-ary codes and Xia-Fu-Ling for binary constant weight codes. Finally, some q-ary constant weight codes which achieve the lower bounds are found.      

Constructions for optimal cyclic ternary constant-weight codes of weight four and distance six

A cyclic ${(n,d,w)}_q$ code is a $q$-ary cyclic code of length $n$, minimum Hamming distance $d$ and weight $w$. In this paper, we investigate cyclic ${(n,6,4)}_3$ codes. A new upper bound on $C{A}_3(n,6,4)$, the largest possible number of codewords in a cyclic ${(n,6,4)}_3$ code, is given. Two new constructions for optimal cyclic ${(n,6,4)}_3$ codes based on cyclic $(n,4,1)$ difference packings are presented. As a consequence, the exact value of $C{A}_3(n,6,4)$ is determined for any positive integer $n\equiv 0,6,18(mod24)$. We also obtain some other infinite classes of optimal cyclic ${(n,6,4)}_3$ codes.     

A tight asymptotic bound on the size of constant-weight conflict-avoiding codes

In the study of multiple-access in the collision channel, conflict-avoiding code is used to guarantee that each transmitting user can send at least one packet successfully in the worst case within a fixed period of time, provided that at most k users out of M potential users are active simultaneously. The number of codewords in a conflict-avoiding code determines the number of potential users that can be supported in a system. Previously, upper bound on the size of conflict-avoiding code is known only for Hamming weights three, four and five. The asymptotic upper in this paper extends the known results to all Hamming weights, and is proved to be tight by exhibiting infinite sequences of conflict-avoiding codes which meet this bound asymptotically for all Hamming weights.     

The relative generalized Hamming weight of linear q-ary codes and their subcodes

In this article, some properties of the relative generalized Hamming weight (RGHW) of linear codes and their subcodes are developed with techniques in finite projective geometry. The relative generalized Hamming weights of almost all 4-dimensional q-ary linear codes and their subcodes are determined.      

New inequalities for subspace arrangements

For each positive integer n?4, we give an inequality satisfied by rank functions of arrangements of n subspaces. When n=4 we recover Ingleton's inequality; for higher n the inequalities are all new. These inequalities can be thought of as a hierarchy of necessary conditions for a (poly)matroid to be realizable. Some related open questions about the “cone of realizable polymatroids” are also presented.     

New methods for linear inequalities

The iterative method of Cimmino for solving linear equations is generalized to linear inequalities. We also present a Richardson-type iterative method for solving the inequality problem, which includes the generalized Cimmino scheme. Convergence proofs are provided.     

New upper bounds for parent-identifying codes and traceability codes

In the last two decades, parent-identifying codes and traceability codes are introduced to prevent copyrighted digital data from unauthorized use. They have important applications in the scenarios like digital fingerprinting and broadcast encryption schemes. A major open problem in this research area is to determine the upper bounds for the cardinalities of these codes. In this paper we will focus on this theme. Consider a code of length N which is defined over an alphabet of size q. Let \(M_{IPPC}(N,q,t)\) and \(M_{TA}(N,q,t)\) denote the maximal cardinalities of t-parent-identifying codes and t-traceability codes, respectively, where t is known as the strength of the codes. We show \(M_{IPPC}(N,q,t)\le rq^{\lceil N/(v-1)\rceil }+(v-1-r)q^{\lfloor N/(v-1)\rfloor }\), where \(v=\lfloor (t/2+1)^2\rfloor \), \(0\le r\le v-2\) and \(N\equiv r \mod (v-1)\). This new bound improves two previously known bounds of Blackburn, and Alon and Stav. On the other hand, \(M_{TA}(N,q,t)\) is still not known for almost all t. In 2010, Blackburn, Etzion and Ng asked whether \(M_{TA}(N,q,t)\le cq^{\lceil N/t^2\rceil }\) or not, where c is a constant depending only on N, and they have shown the only known validity of this bound for \(t=2\). By using some complicated combinatorial counting arguments, we prove this bound for \(t=3\). This is the first non-trivial upper bound in the literature for traceability codes with strength three.     

Some inequalities about the covering radius of Reed-Muller codes

Let R(r, m) be the rth order Reed-Muller code of length 2 ^m , and let (r, m) be its covering radius. We prove that if 2 k m - r - 1, then (r + k, m + k) (r, m + 2(k - 1). We also prove that if m - r 4, 2 k m - r - 1, and R(r, m) has a coset with minimal weight (r, m) which does not contain any vector of weight (r, m) + 2, then (r + k, m + k) (r, m) + 2k(. These inequalities improve repeated use of the known result (r + 1, m + 1) (r, m).This work was supported by a grant from the Research Council of Wright State University.     

New sharp inequalities for operator means

New sharp multiplicative reverses of the operator means inequalities are presented, with a simple discussion of squaring an operator inequality. As a direct consequence, we extend the operator Pólya-Szegö inequality to arbitrary operator means. Furthermore, we obtain some new lower and upper bounds for the Tsallis relative operator entropy, operator monotone functions and positive linear maps.     

New iterative methods for linear inequalities

New iterative methods for solving systems of linear inequalities are presented. Each step in these methods consists of finding the orthogonal projection of the current point onto a hyperplane corresponding to a surrogate constraint which is constructed through a positive combination of a group of violated constraints. Both sequential and parallel implementations are discussed.The authors are grateful to a referee for pointing out the result in Lemma 5.1 and its importance in the proof of Theorem 5.1. This work was supported partially by NSF Grant No. ECS-85-21183.     

New binary codes from extended Goppa codes

An efficient construction of extended length Goppa codes is presented. The construction yields four new binary codes [153, 71, 25], [151, 70, 25], [160, 70, 27], and [158, 69, 27]. The minimum distances are larger than those of the best previously known linear codes of the same length and dimension.     

New extragradient-type methods for solving variational inequalities

In this paper, we propose new methods for solving variational inequalities. The proposed methods can be viewed as a refinement and improvement of the method of He et al. [B.S. He, X.M. Yuan, J.J. Zhang, Comparison of two kinds of prediction–correction methods for monotone variational inequalities, Comp. Opt. Appl. 27 (2004) 247–267] by performing an additional projection step at each iteration and another optimal step length is employed to reach substantial progress in each iteration. Under certain conditions, the global convergence of the both methods is proved. Preliminary numerical experiments are included to illustrate the efficiency of the proposed methods.