Related papers: Doubly even self-orthogonal codes from quasi-symme…
In this paper we characterize the orbit codes as geometrically uniform codes. This characterization is based on the description of all isometries over a projective geometry. In addition, the Abelian orbit codes are defined and a new…
We provide a construction for quantum codes (hermitian-self-orthogonal codes over GF(4)) starting from cyclic codes over GF(4^m). We also provide examples of these codes some of which meet the known bounds for quantum codes.
We analyse the singularity formation of congruences of solutions of systems of second order PDEs via the construction of \emph{shape maps}. The trace of such maps represents a congruence volume whose collapse we study through an appropriate…
In this work, we give three new techniques for constructing Hermitian self-dual codes over commutative Frobenius rings with a non-trivial involutory automorphism using $\lambda$-circulant matrices. The new constructions are derived as…
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…
Let $\mathscr{Q}(m,q)$ and $\mathscr{S}(m,q)$ be the sets of quadratic forms and symmetric bilinear forms on an $m$-dimensional vector space over $\mathbb{F}_q$, respectively. The orbits of $\mathscr{Q}(m,q)$ and $\mathscr{S}(m,q)$ under a…
In this work, we study codes generated by elements that come from group matrix rings. We present a matrix construction which we use to generate codes in two different ambient spaces: the matrix ring $M_k(R)$ and the ring $R,$ where $R$ is…
Sliced Sudoku-based space-filling designs and, more generally, quasi-sliced orthogonal array-based space-filling designs are useful experimental designs in several contexts, including computer experiments with categorical in addition to…
We introduce the first example of algebraically constructed hierarchical quasi-cyclic codes. These codes are built from Reed-Solomon codes using a 1964 construction of superimposed codes by Kautz and Singleton. We show both the number of…
We formulate N-fold supersymmetry in quantum mechanical matrix models. As an example, we construct general two-by-two Hermitian matrix 2-fold supersymmetric quantum mechanical systems. We find that there are two inequivalent such systems,…
We present two constructions for binary self-orthogonal codes. It turns out that our constructions yield a constructive bound on binary self-orthogonal codes. In particular, when the information rate R=1/2, by our constructive lower bound,…
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…
We describe those binary quadratic operads generated by a two-dimensional space that are isomorphic to their Koszul dual operads.
We show that there are good long binary generalized quasi-cyclic self-dual (either Type I or Type II) codes.
We introduce the class of almost symmetric submanifolds of Euclidean space, a close relative of symmetric submanifolds and (contact) sub-Riemannian symmetric spaces. More specifically, we prove that every full irreducible almost symmetric…
Let $P(h),h\in]0,1]$ be a semiclassical scalar differential operator of order $2$. The existence of a supersymmetric structure given by a matrix $G(x;h)$ was exhibited in \cite{HeHiSj13} under rather general assumptions. In this note we…
Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain…
Orthogonal and quasi-orthogonal matrices have a long history of use in digital image processing, digital and wireless communications, cryptography and many other areas of computer science and coding theory. The practical benefits of using…
Let $\mathscr{R}_{e,m}$ denote a finite commutative chain ring of even characteristic with maximal ideal $\langle u \rangle$ of nilpotency index $e \geq 3,$ Teichm$\ddot{u}$ller set $\mathcal{T}_{m},$ and residue field…
The existence of quasi-bi-Hamiltonian structures for the Kepler problem is studied. We first relate the superintegrability of the system with the existence of two complex functions endowed with very interesting Poisson bracket properties…