Related papers: Geometric representation of binary codes and compu…
In this paper, we give a representation of the average of complete joint weight enumerators of two linear codes of length $n$ over $\mathbb{F}_{q}$ and $\mathbb{Z}_{k}$ in terms of the compositions of $n$ and their distributions in the…
The monography considers the problem of constructing a Hamiltonian cycle in a complete graph. A rule for constructing a Hamiltonian cycle based on isometric cycles of a graph is established. An algorithm for constructing a Hamiltonian cycle…
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely determined, up to isomorphism, by the distribution of their…
Boolean functions can be used to construct binary linear codes in many ways, and vice versa. The objective of this short article is to point out a connection between the weight distributions of all projective binary linear codes and the…
Theory of representations of F-algebra is a natural development of the theory of F-algebra. Exploring of morphisms of the representation leads to the concepts of generating set and basis of representation. In the book I considered the…
Starting from a Unified Field Theory (UFT) proposed previously by the author, the possible fermionic representations arising from the same spacetime are considered from the algebraic and geometrical viewpoint. We specifically demonstrate in…
This document describes an attempt to develop a compiler-based approach for computations with symmetric tensors. Given a computation and the symmetries of its input tensors, we derive formulas for random access under a storage scheme that…
Complementary idempotent paravectors and their ordered compositions, are used to represent multivector basis elements of geometric Clifford algebra for 3D Euclidean space as the states of a geometric byte in a given frame of reference. Two…
We study irreducible representations of two classes of conformal Galilei algebras in 1-spatial dimension. We construct a functor which transforms simple modules with nonzero central charge over the Heisenberg subalgebra into simple modules…
There is a one-to-one correspondence between $\ell$-quasi-cyclic codes over a finite field $\mathbb F_q$ and linear codes over a ring $R = \mathbb F_q[Y]/(Y^m-1)$. Using this correspondence, we prove that every $\ell$-quasi-cyclic self-dual…
In this paper, we construct a large family of projective linear codes over ${\mathbb F}_{q}$ from the general simplicial complexes of ${\mathbb F}_{q}^m$ via the defining-set construction, which generalizes the results of [IEEE Trans. Inf.…
In this paper, based on the theory of defining sets, two classes of at most six-weight linear codes over $\mathbb{F}_p$ are constructed. The weight distributions of the linear codes are determined by means of Gaussian period and Weil sums.…
We define and study the Pfaffian state on Riemann surfaces with arbitrary metrics and an inhomogeneous magnetic field and derive its universal transport coefficients. Following a path integral approach, we compute the generating functional…
This book is mainly an exposition of the author's works and his joint works with his former students on explicit representations of finite-dimensional simple Lie algebras, related partial differential equations, linear orthogonal algebraic…
Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…
Cyclic codes are a subclass of linear codes and have wide applications in consumer electronics, data storage systems, and communication systems due to their efficient encoding and decoding algorithms. Cyclic codes with many zeros and their…
A linear-programming decoder for \emph{nonbinary} expander codes is presented. It is shown that the proposed decoder has the maximum-likelihood certificate properties. It is also shown that this decoder corrects any pattern of errors of a…
We show that the cyclic and epicyclic categories which play a key role in the encoding of cyclic homology and the lambda operations, are obtained from projective geometry in characteristic one over the infinite semifield F of "max-plus…
Clifford algebras have broad applications in science and engineering. The use of Clifford algebras can be further promoted in these fields by availability of computational tools that automate tedious routine calculations. We offer an…
This article presents a natural extension of the tensor algebra. In addition to "left multiplications" by vectors, we can consider "derivations" by covectors as basic operators on this extended algebra. These two types of operators satisfy…