A new extension theorem for 3-weight modulo q linear codes over $${\mathbb{F}_ q}$$

We prove that every [n, k, d] _q code with q ≥ 4, k ≥ 3, whose weights are congruent to 0, −1 or −2 modulo q and is extendable unless its diversity is for odd q, where .      

Embeddings of resolvable group divisible designs with block size 3

It is proved in this paper that an RGD(3, g;v) can be embedded in an RGD(3, g;u) if and only if , , , v ≥ 3g, u ≥ 3v, and (g,v) ≠ (2,6),(2,12),(6,18).     

Algebraic-geometry codes, one-point codes, and evaluation codes

One-point codes are those algebraic-geometry codes for which the associated divisor is a non-negative multiple of a single point. Evaluation codes were defined in order to give an algebraic generalization of both one-point algebraic-geometry codes and Reed–Muller codes. Given an -algebra A, an order function on A and given a surjective -morphism of algebras , the ith evaluation code with respect to is defined as the code . In this work it is shown that under a certain hypothesis on the -algebra A, not only any evaluation code is a one-point code, but any sequence of evaluation codes is a sequence of one-point codes. This hypothesis on A is that its field of fractions is a function field over and that A is integrally closed. Moreover, we see that a sequence of algebraic-geometry codes G _i with associated divisors is the sequence of evaluation codes associated to some -algebra A, some order function and some surjective morphism with if and only if it is a sequence of one-point codes.      

On formulas for the index of the circular distributions

A circular distribution is a Galois equivariant map ψ from the roots of unity μ _∞ to an algebraic closure of such that ψ satisfies product conditions, for ϵ ∈ μ _∞ and , and congruence conditions for each prime number l and with (l, s) = 1, modulo primes over l for all , where μ _l and μ _s denote respectively the sets of lth and sth roots of unity. For such ψ, let be the group generated over by and let be , where U _s denotes the global units of . We give formulas for the indices and of and inside the circular numbers P _s and units C _s of Sinnott over . This work was supported by the SRC Program of Korea Science and Engineering Foundation (KOSEF) grant funded by the Korea government (MOST) (No. R11-2007-035-01001-0). This work was supported by the Korea Research Foundation Grant funded by the Korean Government (MOEHRD, Basic Research Promotion Fund) (KRF-2006-312-C00455).     

Another construction for large sets of Kirkman triple systems

A large set of Kirkman triple systems of order v, denoted by LKTS(v), is a collection , where every is a KTS(v) and all form a partition of all triples on X. In this article, we give a new construction for LKTS(6v + 3) via OLKTS(2v + 1) with a special property and obtain new results for LKTS, that is there exists an LKTS(3v) for , where p, q ≥ 0, r _i , s _j ≥ 1, q _i is a prime power and mod 12.      

Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three

A conflict-avoiding code (CAC) C of length n and weight k is a collection of k-subsets of such that holds for any , , where . A CAC with maximum code size for given n and k is called optimal. Furthermore, an optimal CAC C is said to be tight equi-difference if holds and any codeword has the form . The concept of a CAC is motivated from applications in multiple-access communication systems. In this paper, we give a necessary and sufficient condition to construct tight equi-difference CACs of weight k = 3 and characterize the code length n’s admitting the condition through a number theoretical approach.      

Codes defined by forms of degree 2 on non-degenerate Hermitian varieties in $${\mathbb{P}^{4}(\mathbb{F}_q)}$$

We study the functional codes of second order on a non-degenerate Hermitian variety as defined by G. Lachaud. We provide the best possible bounds for the number of points of quadratic sections of . We list the first five weights, describe the corresponding codewords and compute their number. The paper ends with two conjectures. The first is about minimum distance of the functional codes of order h on a non-singular Hermitian variety . The second is about distribution of the codewords of first five weights of the functional codes of second order on a non-singular Hermitian variety .      

Elliptic near-MDS codes over $${\mathbb{F}}_5$$

Let Γ₆ be the elliptic curve of degree 6 in PG(5, q) arising from a non-singular cubic curve of PG(2, q) via the canonical Veronese embedding

LDPC codes from the Hermitian curve

In this paper, we study the code which has as parity check matrix the incidence matrix of the design of the Hermitian curve and its (q + 1)-secants. This code is known to have good performance with an iterative decoding algorithm, as shown by Johnson and Weller in (Proceedings at the ICEE Globe com conference, Sanfrancisco, CA, 2003). We shall prove that has a double cyclic structure and that by shortening in a suitable way it is possible to obtain new codes which have higher code-rate. We shall also present a simple way to constructing the matrix via a geometric approach.      

On $${\mathcal{F}}$$ -supplemented subgroups of finite groups

Let G be a finite group and a formation of finite groups. We say that a subgroup H of G is -supplemented in G if there exists a subgroup T of G such that G = TH and is contained in the -hypercenter of G/H _G . In this paper, we use -supplemented subgroups to study the structure of finite groups. A series of previously known results are unified and generalized. Research of the author is supported by a NNSF grant of China (Grant #10771180).     

Maximal partial packings of $${Z_2^n}$$ with perfect codes

A maximal partial Hamming packing of is a family of mutually disjoint translates of Hamming codes of length n, such that any translate of any Hamming code of length n intersects at least one of the translates of Hamming codes in . The number of translates of Hamming codes in is the packing number, and a partial Hamming packing is strictly partial if the family does not constitute a partition of . A simple and useful condition describing when two translates of Hamming codes are disjoint or not disjoint is proved. This condition depends on the dual codes of the corresponding Hamming codes. Partly, by using this condition, it is shown that the packing number p, for any maximal strictly partial Hamming packing of , n = 2 ^m −1, satisfies . It is also proved that for any n equal to 2 ^m −1, , there exist maximal strictly partial Hamming packings of with packing numbers n−10,n−9,n−8,...,n−1. This implies that the upper bound is tight for any n = 2 ^m −1, . All packing numbers for maximal strictly partial Hamming packings of , n = 7 and 15, are found by a computer search. In the case n = 7 the packing number is 5, and in the case n = 15 the possible packing numbers are 5,6,7,...,13 and 14.      

Further properties of several classes of Boolean functions with optimum algebraic immunity

Based on a method proposed by the first author, several classes of balanced Boolean functions with optimum algebraic immunity are constructed, and they have nonlinearities significantly larger than the previously best known nonlinearity of functions with optimal algebraic immunity. By choosing suitable parameters, the constructed n-variable functions have nonlinearity for even for odd n, where Δ(n) is a function increasing rapidly with n. The algebraic degrees of some constructed functions are also discussed.      

Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles

We find lower bounds on the minimum distance and characterize codewords of small weight in low-density parity check (LDPC) codes defined by (dual) classical generalized quadrangles. We analyze the geometry of the non-singular parabolic quadric in PG(4,q) to find information about the LDPC codes defined by Q (4,q), and . For , and , we are able to describe small weight codewords geometrically. For , q odd, and for , we improve the best known lower bounds on the minimum distance, again only using geometric arguments. Similar results are also presented for the LDPC codes LU(3,q) given in [Kim, (2004) IEEE Trans. Inform. Theory, Vol. 50: 2378–2388]     

$${\mathcal{R}}$$ -boundedness,pseudodifferential operators,and maximal regularity for some classes of partial differential operators

It is shown that an elliptic scattering operator A on a compact manifold with boundary with operator valued coefficients in the morphisms of a bundle of Banach spaces of class () and Pisier’s property (α) has maximal regularity (up to a spectral shift), provided that the spectrum of the principal symbol of A on the scattering cotangent bundle avoids the right half-plane. This is accomplished by representing the resolvent in terms of pseudodifferential operators with -bounded symbols, yielding by an iteration argument the -boundedness of λ(A−λ)⁻¹ in for some . To this end, elements of a symbolic and operator calculus of pseudodifferential operators with -bounded symbols are introduced. The significance of this method for proving maximal regularity results for partial differential operators is underscored by considering also a more elementary situation of anisotropic elliptic operators on with operator valued coefficients.     

Self-dual codes over \mathbb{Z}_8 and \mathbb{Z}_9

We study self-dual codes over the rings and . We define various weights and weight enumerators over these rings and describe the groups of invariants for each weight enumerator over the rings. We examine the torsion codes over these rings to describe the structure of self-dual codes. Finally we classify self-dual codes of small lengths over .     

Fibred multilinks and singularities $${f \overline g}$$

In this article we extend Milnor’s fibration theorem to the case of functions of the form with f, g holomorphic, defined on a complex analytic (possibly singular) germ (X, 0). We further refine this fibration theorem by looking not only at the link of , but also at its multi-link structure, which is more subtle. We mostly focus on the case when X has complex dimension two. Our main result (Theorem 4.4) gives in this case the equivalence of the following three statements:

Some remarks on systems of elliptic equations doubly critical in the whole $${\mathbb{R}^N}$$

We study the existence of different types of positive solutions to problem

Ground state alternative for <Emphasis Type="Italic">p</Emphasis>-Laplacian with potential term

Let Ω be a domain in , d ≥ 2, and 1 < p < ∞. Fix . Consider the functional Q and its Gateaux derivative Q′ given by If Q ≥ 0 on, then either there is a positive continuous function W such that for all, or there is a sequence and a function v > 0 satisfying Q′ (v) = 0, such that Q(u _k ) → 0, and in . In the latter case, v is (up to a multiplicative constant) the unique positive supersolution of the equation Q′ (u) = 0 in Ω, and one has for Q an inequality of Poincaré type: there exists a positive continuous function W such that for every satisfying there exists a constant C > 0 such that . As a consequence, we prove positivity properties for the quasilinear operator Q′ that are known to hold for general subcritical resp. critical second-order linear elliptic operators.     

The cubic Segre variety in PG(5, 2)

The Segre variety in PG(5, 2) is a 21-set of points which is shown to have a cubic equation Q(x) = 0. If T(x, y, z) denotes the alternating trilinear form obtained by completely polarizing the cubic polynomial Q, then the associate U ^# of an r-flat is defined to be

A geometric inequality in the Heisenberg group and its applications to stable solutions of semilinear problems

In the Heisenberg group framework, we obtain a geometric inequality for stable solutions of in a domain . More precisely, if we denote the horizontal intrinsic Hessian by Hu, the mean curvature of a level set by h, its imaginary curvature by p, the intrinsic normal by ν and the unit tangent by υ, we have that