Related papers: Geometric representation of binary codes and compu…
We classify all $q$-ary $\Delta$-divisible linear codes which are spanned by codewords of weight $\Delta$. The basic building blocks are the simplex codes, and for $q=2$ additionally the first order Reed-Muller codes and the parity check…
The linear codes with a few weights have been applied widely in combinatorial designs, secret sharing, association schemes, authentication codes and strongly regular graphs. In this paper, we first correct an erroneous result about the…
We provide a computational definition of the notions of vector space and bilinear functions. We use this result to introduce a minimal language combining higher-order computation and linear algebra. This language extends the Lambda-calculus…
The paper describes a new algorithm of construction of the nonlinear arithmetic triangle on the basis of numerical simulation and the binary system. It demonstrates that the numbers that fill the nonlinear arithmetic triangle may be…
The explicit computation of higher-point conformal blocks in any dimension is usually a challenging task. For two-dimensional conformal field theories in Euclidean signature, the oscillator formalism proves to be very efficient. We…
Linear codes with a few weights have important applications in authentication codes, secret sharing, consumer electronics, etc.. The determination of the parameters such as Hamming weight distributions and complete weight enumerators of…
Let C(X) be the algebra generated by the curvature 2-forms of the standard hermitian line bundles over the complex homogeneous manifold X=G/B. We calculate the Hilbert polynomial of C(X) and give its presentation as a quotient of a…
After a short introduction on Clifford algebras of polynomials, we give a general method of constructing a matrix representation. This process of linearization leads naturally to two fundamental structures: the generalized Clifford algebra…
Recently, linear codes constructed from defining sets have been investigated extensively and they have many applications. In this paper, for an odd prime $p$, we propose a class of $p$-ary linear codes by choosing a proper defining set.…
The generalized Hamming weights (GHWs) of linear codes are fundamental parameters, the knowledge of which is of great interest in many applications. However, to determine the GHWs of linear codes is difficult in general. In this paper, we…
We extend the concepts of the associator and commutator from algebras with a binary multiplication law to algebras with a ternary multiplication law using cube roots of unity. By analogy with the Jacobi identity for the binary commutator,…
We study trace codes with defining set $L,$ a subgroup of the multiplicative group of an extension of degree $m$ of the alphabet ring $\mathbb{F}_3+u\mathbb{F}_3+u^{2}\mathbb{F}_{3},$ with $u^{3}=1.$ These codes are abelian, and their…
A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…
In this paper, several classes of three-weight ternary linear codes from non-weakly regular dual-bent functions are constructed based on a generic construction method. Instead of the whole space, we use the subspaces $B_+(f)$ or $B_-(f)$…
We introduce a general class of codes which includes several well-known classes of deletion/insertion correcting codes as special cases. For example, the Helberg code, the Levenshtein code, the Varshamov--Tenengolts code, and most variants…
The real number system is geometrically extended to include three new anticommuting square roots of plus one, each such root representing the direction of a unit vector along the orthonormal coordinate axes of Euclidean 3-space. The…
A class of optimal three-weight cyclic codes of dimension 3 over any finite field was presented by Vega [Finite Fields Appl., 42 (2016) 23-38]. Shortly thereafter, Heng and Yue [IEEE Trans. Inf. Theory, 62(8) (2016) 4501-4513] generalized…
The main theorem in this paper is a far-reaching generalization of Gleason's theorem on the weight enumerators of codes which applies to arbitrary-genus weight enumerators of self-dual codes defined over a large class of finite rings and…
In this article, we show explicitly all possible weight enumerators for every irreducible cyclic code of length $n$ over a finite field $\mathbb F_q$, in the case which each prime divisor of $n$ is also a divisor of $q-1$.
An $\alpha$-parameter representation is derived for gauge field theories.It involves, relative to a scalar field theory, only constants and derivatives with respect to the $\alpha$-parameters. Simple rules are given to obtain the…