Related papers: On self-dual double negacirculant codes
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…
We consider the existence of robust strange nonchaotic attractors (SNA's) in a simple class of quasiperiodically forced systems. Rigorous results are presented demonstrating that the resulting attractors are strange in the sense that their…
A linear code with parameters $[n, k, n-k+1]$ is called a maximum distance separable (MDS for short) code. A linear code with parameters $[n, k, n-k]$ is said to be almost maximum distance separable (AMDS for short). A linear code is said…
Two-sided conformally recurrent 4-dimensional self-dual spaces are considered. It is shown that such spaces are equipped with nonexpanding congruences of null strings. The general structure of weak nonexpanding hyperheavenly spaces is…
In the model of extended non-Abelian tensor gauge fields we have found new metric-independent densities: the exact (2n+3)-forms and their secondary characteristics, the (2n+2)-forms as well as the exact 6n-forms and the corresponding…
In this work, we give a new technique for constructing self-dual codes over commutative Frobenius rings using $\lambda$-circulant matrices. The new construction was derived as a modification of the well-known four circulant construction of…
In an interesting paper Professor Cunsheng Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and…
In the present paper, we study the geometric discrepancy with respect to families of rotated rectangles. The well-known extremal cases are the axis-parallel rectangles (logarithmic discrepancy) and rectangles rotated in all possible…
The Gilbert-Varshamov bound states that the maximum size A_2(n,d) of a binary code of length n and minimum distance d satisfies A_2(n,d) >= 2^n/V(n,d-1) where V(n,d) stands for the volume of a Hamming ball of radius d. Recently Jiang and…
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, a class of three-weight…
Line systems passing through the origin of the $d$ dimensional Euclidean space admitting exactly two distinct angles are called biangular. It is shown that the maximum cardinality of biangular lines is at least $2(d-1)(d-2)$, and this…
In this paper, an explicit representation and enumeration for negacyclic codes of length $2^kn$ over the local non-principal ideal ring $R=\mathbb{Z}_4+u\mathbb{Z}_4$ $(u^2=0)$ is provided, where $k, n$ are any positive integers and $n$ is…
In this paper, we produce two new classes of entanglement-assisted quantum MDS codes (EAQMDS codes) with length $n|q^2-1$ and $n|q^2+1$ via cyclic codes over finite fields of odd characteristic. Among our constructions there are many EAQMDS…
In this note, we explore various cohomological invariants on double complexes with the aim of finding their decomposition into irreducible parts, which are of square and zigzag shape. By studying the growth rate of the number of invariants…
The presence of Killing-Yano tensors implies the existence of non-generic supercharges in spinning point particle theories on curved backgrounds. Dual metrics are defined through their associated non-degenerate Killing tensors of valence…
In this note, we complete the classification of extremal doubly even self-dual codes with 2-transitive automorphism groups.
Bicyclic codes are a generalization of the one dimensional (1D) cyclic codes to two dimensions (2D). Similar to the 1D case, in some cases, 2D cyclic codes can also be constructed to guarantee a specified minimum distance. Many aspects of…
An efficient algorithm for classification of binary self-dual codes is presented. As an application, a complete classification of the self-dual codes of length 38 is given.
Binary linear codes are constructed from graphs, in particular, by the generator matrix $[I_n|A]$ where $A$ is the adjacency matrix of a graph on $n$ vertices. A combinatorial interpretation of the minimum distance of such codes is given.…
A classical result of Conway and Pless is that a natural projection of the fixed code of an automorphism of odd prime order of a self-dual binary linear code is self-dual. In this paper we prove that the same holds for involutions under…