Related papers: Double Circulant Self-Dual Codes From Generalized …
MDS self-dual codes have nice algebraic structures and are uniquely determined by lengths. Recently, the construction of MDS self-dual codes of new lengths has become an important and hot issue in coding theory. In this paper, we develop…
We prove that the only primes which may divide the order of the automorphism group of a putative binary self-dual doubly-even [120, 60, 24] code are 2, 3, 5, 7, 19, 23 and 29. Furthermore we prove that automorphisms of prime order $p \geq…
Binary cyclic codes having large dimensions and minimum distances close to the square-root bound are highly valuable in applications where high-rate transmission and robust error correction are both essential. They provide an optimal…
Based on the ideas of cyclotomic cosets, idempotents and Mattson-Solomon polynomials, we present a new method to construct GF(2^m), where m>0 cyclic low-density parity-check codes. The construction method produces the dual code idempotent…
In this work, we introduce 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…
Self-dual maximum distance separable codes (self-dual MDS codes) and self-dual near MDS codes are very important in coding theory and practice. Thus, it is interesting to construct self-dual MDS or self-dual near MDS codes. In this paper,…
The automorphism group of a binary doubly-even self-dual code is always contained in the alternating group. On the other hand, given a permutation group $G$ of degree $n$ there exists a doubly-even self-dual $G$-invariant code if and only…
We provide an algorithm to construct unitary matrices over finite fields. We present various constructions of Hermitian self-dual code by means of unitary matrices, where some of them generalize the quadratic double circulant constructions.…
In this paper, we apply two-to-one functions over $\mathbb{F}_{2^n}$ in two generic constructions of binary linear codes. We consider two-to-one functions in two forms: (1) generalized quadratic functions; and (2) $\left(x^{2^t}+x\right)^e$…
In this work, we introduce new construction methods for self-dual codes using a Baumert-Hall array. We apply the constructions over the alphabets F_2 and F_4 + uF_4 and combine them with extension theorems and neighboring constructions. As…
One of the main objectives of quantum error-correction theory is to construct quantum codes with optimal parameters and properties. In this paper, we propose a class of 2-generator quasi-cyclic codes and study their applications in the…
Linear codes with a few weights have many nice applications including combinatorial design, distributed storage system, secret sharing schemes and so on. In this paper, we construct two families of linear codes with a few weights based on…
Binary linear codes with good parameters have important applications in secret sharing schemes, authentication codes, association schemes, and consumer electronics and communications. In this paper, we construct several classes of binary…
In this paper, on one hand, a class of linear codes with one or two weights is obtained. Based on these linear codes, we construct two classes of constant composition codes, which includes optimal constant composition codes depending on…
In the field of algebraic geometric codes (AG codes), the characterization of dual codes has long been a challenging problem which relies on differentials. In this paper, we provide some descriptions for certain differentials utilizing…
Recently, some infinite families of binary minimal and optimal linear codes are constructed from simplicial complexes by Hyun {\em et al}. Inspired by their work, we present two new constructions of codes over the ring $\Bbb F_2+u\Bbb F_2$…
A classification of Hadamard matrices of order $2p+2$ with an automorphism of order $p$ is given for $p=29$ and $31$. The ternary self-dual codes spanned by the newly found Hadamard matrices of order $60$ with an automorphism of order $29$…
In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…
We consider linear cyclic codes with the locality property, or locally recoverable codes (LRC codes). A family of LRC codes that generalize the classical construction of Reed-Solomon codes was constructed in a recent paper by I. Tamo and A.…
The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…