Weight distributions of a class of cyclic codes with arbitrary number of nonzeros in quadratic case

Cyclic codes are an important class of linear codes, whose weight distribution have been extensively studied. So far, most of previous results obtained were for cyclic codes with no more than three nonzeros. Recently, the authors of [37] constructed a class of cyclic codes with arbitrary number of nonzeros, and computed the weight distribution for several cases. In this paper, we determine the weight distribution for a new family of such codes. This is achieved by introducing certain new methods, such as the theory of Jacobi sums over finite fields and subtle treatment of some complicated combinatorial identities.     

The Friedberg–Lee symmetry and minimal seesaw model

The Friedberg–Lee (FL) symmetry is generated by a transformation of a fermionic field q to q+ξz. This symmetry puts very restrictive constraints on allowed terms in a Lagrangian. Applying this symmetry to N fermionic fields, we find that the number of independent fields is reduced to N−1 if the fields have gauge interaction or the transformation is a local one. Using this property, we find that a seesaw model originally with three generations of left- and right-handed neutrinos, with the left-handed neutrinos unaffected but the right-handed neutrinos transformed under the local FL translation, is reduced to an effective theory of minimal seesaw which has only two right-handed neutrinos. The symmetry predicts that one of the light neutrino masses must be zero.     

On Weierstrass semigroups and sets: a review with new results

In this work we present a survey of the main results in the theory of Weierstrass semigroups at several points, with special attention to the determination of bounds for the cardinality of its set of gaps. We also review results on applications to the theory of error correcting codes. We then recall a generalization of the concept of Weierstrass semigroup, which is the Weierstrass set associated to a linear system and several points. We finish by presenting new results on this Weierstrass set, including some on the cardinality of its set of gaps.      

Generalized MacWilliams identities and their applications to perfect binary codes

We present generalized MacWilliams identities for binary codes. These identities naturally lead to the concepts of the local weight distribution of a binary code with respect to a word u and its MacWilliams u-transform. In the case that u is the all-one word, these ones correspond to the weight distribution of a binary code and its MacWilliams transform, respectively. We identify a word v with its support, and consider v as a subset of {1, 2,..., n}. For two words u,w of length n such that their intersection is the empty set, define the u-face centered at w to be the set . A connection between our MacWilliams u-transform and the weight distribution of a binary code in the u-face centered at the zero word is presented. As their applications, we also investigate the properties of a perfect binary code. For a perfect binary code C, the main results are as follows: first, it is proved that our local weight distribution of C is uniquely determined by the number of codewords of C in the orthogonal u-face centered at the zero word. Next, we give a direct proof for the known result, concerning the weight distribution of a coset of C in the u-face centered at the zero word, by A. Y. Vasil’eva without using induction. Finally, it is proved that the weight distribution of C in the orthogonal u-face centered at w is uniquely determined by the codewords of C in the u-face centered at the zero word.      

The postage stamp problem and arithmetic in base <Emphasis Type="Italic">r</Emphasis>

Let h, k be fixed positive integers, and let A be any set of positive integers. Let hA ≔ {a ₁ + a ₂ + ... + a _r : a _i ∈ A, r ⩽ h} denote the set of all integers representable as a sum of no more than h elements of A, and let n(h, A) denote the largest integer n such that {1, 2,...,n} ⊆ hA. Let n(h, k) := : n(h, A), where the maximum is taken over all sets A with k elements. We determine n(h, A) when the elements of A are in geometric progression. In particular, this results in the evaluation of n(h, 2) and yields surprisingly sharp lower bounds for n(h, k), particularly for k = 3.     

Construction of the extremal function for a functional on the classH ω (n)

For a functional on the classH _ω ⁽ⁿ⁾ ,n≥3, we construct the extremal function on which the upper bound obtained by A. I. Stepanets is attained. Translated fromMatematicheskie Zametki, Vol. 61, No. 4, pp. 519–529, April, 1997. Translated by N. K. Kulman     

Weight Enumerators of Double Circulant Codes and New Extremal Self-Dual Codes

In this paper it is shown that the weight enumerator of a bordered double circulant self-dual code can be obtained from those of a pure double circulant self-dual code and its shadow through a relationship between bordered and pure double circulant codes. As applications, a restriction on the weight enumerators of some extremal double circulant codes is determined and a uniqueness proof of extremal double circulant self-dual codes of length 46 is given. New extremal singly-even [44,22,8] double circulant codes are constructed. These codes have weight enumerators for which extremal codes were not previously known to exist.     

A complete classification of ternary self-dual codes of length 24

Ternary self-dual codes have been classified for lengths up to 20. At length 24, a classification of only extremal self-dual codes is known. In this paper, we give a complete classification of ternary self-dual codes of length 24 using the classification of 24-dimensional odd unimodular lattices.