Related papers: On the support designs of extremal binary doubly e…
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…
In this note, we give basic properties of ternary four-negacirculant self-dual codes. By exhaustive computer search based on the properties, we complete a classification of ternary extremal four-negacirculant self-dual codes of lengths 40,…
We formulate the conformal packing problem and dual packing problem in analogy to similar problems for binary codes and lattices. We obtain explicit numerical upper bounds for the minimal dual conformal weight of a unitary strongly-rational…
Upper bounds are given for the weight distribution of binary weakly self-dual codes. To get these new bounds, we introduce a novel method of utilizing unitary operations on Hilbert spaces. This method is motivated by recent progress on…
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…
We previously proposed the first nontrivial examples of a code having support $t$-designs for all weights obtained from the Assmus-Mattson theorem and having support $t'$-designs for some weights with some $t'>t$. This suggests the…
It has been known for a long time that $t$-designs can be employed to construct both linear and nonlinear codes and that the codewords of a fixed weight in a code may hold a $t$-design. While a lot of progress in the direction of…
In this paper, constructions of some double circulant self-dual codes by generalized cyclotomic classes of order two are presented. This technique is applied to [72, 36, 12] binary highest know self-dual codes to obtain self-dual codes over…
A Type IV-II Z4-code is a self-dual code over Z4 with the property that all Euclidean weights are divisible by eight and all codewords have even Hamming weight. In this paper we use generalized bent functions for a construction of…
We complete the building-up construction for self-dual codes by resolving the open cases over $GF(q)$ with $q \equiv 3 \pmod 4$, and over $\Z_{p^m}$ and Galois rings $\GR(p^m,r)$ with an odd prime $p$ satisfying $p \equiv 3 \pmod 4$ with…
For the past decades, linear codes with few weights have been widely studied, since they have applications in space communications, data storage and cryptography. In this paper, a class of binary linear codes is constructed and their weight…
We study the performance of ternary isodual codes which are not self-dual and ternary self-dual codes, as measured by the decoding error probability in bounded distance decoding. We compare the performance of ternary double circulant and…
Linear complementary dual (LCD) codes are linear codes that intersect with their dual codes trivially. We study the largest minimum weight $d_2(n,k)$ among all binary LCD $[n,k]$ codes and the largest minimum weight $d_3(n,k)$ among all…
We introduce quaternary modified four $\mu$-circulant codes as a modification of four circulant codes. We give basic properties of quaternary modified four $\mu$-circulant Hermitian self-dual codes. We also construct quaternary modified…
In this note we investigate extremal singly-even self-dual codes with minimal shadow. For particular parameters we prove non-existence of such codes. By a result of Rains \cite{Rains-asymptotic}, the length of extremal singly-even self-dual…
Tang and Ding [IEEE IT 67 (2021) 244-254] studied the class of narrow-sense BCH codes $\mathcal{C}_{(q,q+1,4,1)}$ and their dual codes with $q=2^m$ and established that the codewords of the minimum (or the second minimum) weight in these…
Self-dual codes over $\Z_2\times\Z_4$ are subgroups of $\Z_2^\alpha \times\Z_4^\beta$ that are equal to their orthogonal under an inner-product that relates to the binary Hamming scheme. Three types of self-dual codes are defined. For each…
Minimal codes are linear codes where all non-zero codewords are minimal, i.e., whose support is not properly contained in the support of another codeword. The minimum possible length of such a $k$-dimensional linear code over $\mathbb{F}_q$…
It has been proven in a series of works that the order of the automorphism group of a binary [72,36,16] code does not exceed five. We obtain a parametrization of all self-dual binary codes of length 72 with automorphism of order 4 which can…
Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study binary linear complementary dual $[n,k]$ codes with the largest minimum weight among all binary…