Divisible formal weight enumerators and extremal polynomials not satisfying the Riemann hypothesis

In this paper, first we formulate the notion of divisible formal weight enumerators and propose an algorithm for the efficient search of the formal weight enumerators divisible by two. The main tools are the binomial moments. It leads to the discovery of several new families of formal weight enumerators. Then, as a result, we find examples of extremal formal weight enumerators which do not satisfy the Riemann hypothesis.     

The joint weight enumerators and Siegel modular forms

The weight enumerator of a binary doubly even self-dual code is an isobaric polynomial in the two generators of the ring of invariants of a certain group of order 192. The aim of this note is to study the ring of coefficients of that polynomial, both for standard and joint weight enumerators.

     

A quasi‐symmetric 2‐(49,9,6) design

Huffman and Tonchev discovered four non‐isomorphic quasi‐symmetric 2‐(49,9,6) designs. They arise from extremal self‐dual [50,25,10] codes with a certain weight enumerator. In this note, a new quasi‐symmetric 2‐(49,9,6) design is constructed. This is established by finding a new extremal self‐dual [50,25,10] code as a neighbor of one of the four extremal codes discovered by Huffman and Tonchev. A number of new extremal self‐dual [50,25,10] codes with other weight enumerators are also found. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 173–179, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10007     

Signcryption with Non-interactive Non-repudiation

In this paper various methods for computing the support weight enumerators of binary, linear, even, isodual codes are described. It is shown that there exist relationships between support weight enumerators and coset weight distributions of a code that can be used to compute partial information about one set of these code invariants from the other. The support weight enumerators and complete coset weight distributions of several even, isodual codes of length up to 22 are computed as well. It is observed that there exist inequivalent codes with the same support weight enumerators, inequivalent codes with the same complete coset weight distribution and inequivalent codes with the same support eight enumerators and complete coset weight distribution.Communicated by:T. HellesethAMS Classification: 11T71, 68P30Parts of the results in this paper were presented at the 2001 International Symposium on Information Theory, Washington, and at the 2002 International Symposium on Information Theory, Lauzanne.     

Complete m-spotty weight enumerators of binary codes,Jacobi forms,and partial Epstein zeta functions

The MacWilliams identity for the complete m-spotty weight enumerators of byte-organized binary codes is a generalization of that for the Hamming weight enumerators of binary codes. In this paper, Jacobi forms are obtained by substituting theta series into the complete m-spotty weight enumerators of binary Type II codes. The Mellin transforms of those theta series provide functional equations for partial Epstein zeta functions which are summands of classical Epstein zeta functions associated with quadratic forms. Then, it is observed that the coefficient matrices appearing in those functional equations are exactly the same as the transformation matrices in the MacWilliams identity for the complete m-spotty weight enumerators of binary self-dual codes.     

Three-weight linear codes from Weil sums

Journal of Algebraic Combinatorics - By appropriately choosing a defining set, we define a class of linear codes and establish their complete weight enumerators and weight enumerators using Weil...     

Near-Extremal Formally Self-Dual Even Codes of Lengths 24 and 32

The weight enumerator of a formally self-dual even code is obtained by the Gleason theorem. Recently, Kim and Pless gave some restrictions on the possible weight enumerators of near-extremal formally self-dual even codes of length divisible by eight. In this paper, the weight enumerators for which there is a near-extremal formally self-dual even code are completely determined for lengths 24 and 32, by constructing new near-extremal formally self-dual codes. We also give a classification of near- extremal double circulant codes of lengths 24 and 32. Communicated by: P. Fitzpatrick     

New extremal binary self-dual codes of length 68 from generalized neighbors

In this work, we use the concept of distance between self-dual codes, which generalizes the concept of a neighbor for self-dual codes. Using the k-neighbors, we are able to construct extremal binary self-dual codes of length 68 with new weight enumerators. We construct 143 extremal binary self-dual codes of length 68 with new weight enumerators including 42 codes with $\gamma =8$ in their $W_{68,2}$ and 40 with $\gamma =9$ in their $W_{68,2}$. These examples are the first in the literature for these γ values. This completes the theoretical list of possible values for γ in $W_{68,2}$.     

Probability Distribution Functions of Succession Quotas in the Case of Markov Dependent Trials

The exact probability distribution functions (pdf's) of the sooner andlater waiting time random variables (rv's) for the succession quota problemare derived presently in the case of Markov dependent trials. This is doneby means of combinatorial arguments. The probability generating functions(pgf's) of these rv's are then obtained by means of enumerating generatingfunctions (enumerators). Obvious modifications of the proofs provideanalogous results for the occurrence of frequency quotas and such a resultis established regarding the pdf of a frequency and succession quotas rv.Longest success and failure runs are also considered and their jointcumulative distribution function (cdf) is obtained.     

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.     

Weight enumerators,intersection enumerators,and Jacobi polynomials

The intersection enumerator and the Jacobi polynomial in an arbitrary genus for a binary code are introduced. Adding the weight enumerator into our discussion, we give the explicit relations among them and give some of their basic properties.     

Distance Enumerators for Permutation Groups

We consider the distance enumerator Δ _G (x) of a finite permutation group G, which is the polynomial ∑ _g∈G x ^n?π(g), where n is the degree of G and π(g) the number of fixed points of g ∈ G. In particular, we introduce a bivariate polynomial which is a special case of the cycle index of G, and from which Δ _G (x) can be obtained, and then use this new polynomial to prove some identities relating the distance enumerators of groups G and H with those of their direct and wreath products. In the case of the direct product, this answers a question of Blake et al. (1979 Blake , I. F. , Cohen , G. , Deza , M. ( 1979 ). Coding with permutations . Information and Control 43 : 1 – 19 . [Google Scholar]). We also use the identity for the wreath product to find an explicit combinatorial expression for the distance enumerators of the generalised hyperoctahedral groups C _m  ? S _n .     

Jacobi Polynomials, Type II Codes, and Designs

Jacobi polynomials were introduced by Ozeki in analogy with Jacobi forms of lattices. They are useful to compute coset weight enumerators, and weight enumerators of children. We determine them in most interesting cases in length at most 32, and in some cases in length 72. We use them to construct group divisible designs, packing designs, covering designs, and (t,r)-designs in the sense of Calderbank-Delsarte. A major tool is invariant theory of finite groups, in particular simultaneous invariants in the sense of Schur, polarization, and bivariate Molien series. A combinatorial interpretation of the Aronhold polarization operator is given. New rank parameters for spaces of coset weight distributions and Jacobi polynomials are introduced and studied here.     

On Harmonic Weight Enumerators of Binary Codes

We define some new polynomials associated to a linear binary code and a harmonic function of degree k. The case k=0 is the usual weight enumerator of the code. When divided by (xy) ^k , they satisfy a MacWilliams type equality. When applied to certain harmonic functions constructed from Hahn polynomials, they can compute some information on the intersection numbers of the code. As an application, we classify the extremal even formally self-dual codes of length 12.     

Latroids and their representation by codes over modules

It has been known for some time that there is a connection between linear codes over fields and matroids represented over fields. In fact a generator matrix for a linear code over a field is also a representation of a matroid over that field. There are intimately related operations of deletion, contraction, minors and duality on both the code and the matroid. The weight enumerator of the code is an evaluation of the Tutte polynomial of the matroid, and a standard identity relating the Tutte polynomials of dual matroids gives rise to a MacWilliams identity relating the weight enumerators of dual codes. More recently, codes over rings and modules have been considered, and MacWilliams type identities have been found in certain cases.

In this paper we consider codes over rings and modules with code duality based on a Morita duality of categories of modules. To these we associate latroids, defined here. We generalize notions of deletion, contraction, minors and duality, on both codes and latroids, and examine all natural relations among these.

We define generating functions associated with codes and latroids, and prove identities relating them, generalizing above-mentioned generating functions and identities.

     

On McEliece's Theorem

A new simple proof of the well-known theorem of McEliece about the complete weight enumerators of ternary self-dual codes is given.     

A formula on the weight distribution of linear codes with applications to AMDS codes

The determination of the weight distribution of linear codes has been a fascinating problem since the very beginning of coding theory. There has been a lot of research on weight enumerators of special cases, such as self-dual codes and codes with small Singleton's defect. We propose a new set of linear relations that must be satisfied by the coefficients of the weight distribution. From these relations we are able to derive known identities (in an easier way) for interesting cases, such as extremal codes, Hermitian codes, MDS and NMDS codes. Moreover, we are able to present for the first time the weight distribution of AMDS codes. We also discuss the link between our results and the Pless equations.