Related papers: A characterization of $\mathbb{Z}_2\mathbb{Z}_2[u]…
We introduce self-dual codes over the Kleinian four group $K = \mathbb{Z}_2 \times \mathbb{Z}_2$ for a natural quadratic form on $K^n$ and develop the theory. Topics studied are: weight enumerators, mass formulas, classification up to…
Let $R$ be a finite commutative chain ring, $D_{2n}$ be the dihedral group of size $2n$ and $R[D_{2n}]$ be the dihedral group ring. In this paper, we completely characterize left ideals of $R[D_{2n}]$ (called left $D_{2n}$-codes) when ${\rm…
Ordered, linear, and other substructural type systems allow us to expose deep properties of programs at the syntactic level of types. In this paper, we develop a family of unary logical relations that allow us to prove consequences of…
Self-dual codes are important because many of the best codes known are of this type and they have a rich mathematical theory. Topics covered in this survey include codes over F_2, F_3, F_4, F_q, Z_4, Z_m, shadow codes, weight enumerators,…
We consider the question: When do two finite abelian groups have isomorphic lattices of characteristic subgroups? An explicit description of the characteristic subgroups of such groups enables us to give a complete answer to this question…
We construct classes of $Z_2 \times Z_2$-graded Lie algebras corresponding to the classical Lie algebras, in terms of their defining matrices. For the $Z_2 \times Z_2$-graded Lie algebra of type $A$, the construction coincides with the…
A large family of linear codes with flexible parameters from almost bent functions and perfect nonlinear functions are constructed and their parameters are determined. Some constructed linear codes and their related codes are optimal in the…
We prove that if two nonzero homomorphisms from the Cuntz algebra O_infinity to a purely infinite simple C*-algebra have the same class in KK-theory, and if either both are unital or both are nonunital, then they are approximately unitarily…
A binary linear code whose permutation automorphism group has a fixed point free permutation of order $3$ is called a binary cubic code. The scope of this paper is to investigate the structural properties of binary cubic codes. Let $C$ be a…
We show that under the proper forcing axiom the class of all Aronszajn lines behave like $\sigma$-scattered orders under the embeddability relation. In particular, we are able to show that the class of better quasi order labeled fragmented…
In [2], an exhaustive construction is achieved for the class of all 4-dimensional unital division algebras over finite fields of odd order, whose left nucleus is not minimal and whose automorphism group contains Klein's four-group. We…
When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…
The purpose of this paper is to investigate the finite group which appears in the study of the Type II $\mathbf{Z}_4$-codes. To be precise, it is characterized in terms of generators and relations, and we determine the structure of the…
Let $R$ be a finite ring with identity. The clean graph $Cl(R)$ of a ring $R$ is a graph whose vertices are pairs $(e, u)$, where $e$ is an idempotent element and $u$ is a unit of $R$. Two distinct vertices $(e, u)$ and $(f, v)$ are…
We present a structure associated to the class of linear codes. The properties of that structure are similar to some structures in the linear algebra techniques into the framework of the Gr\"obner bases tools. It allows to get some insight…
In this paper we study the main characteristics of some evaluation codes parameterized by the edges of a bipartite graph with a perfect matching.
In this paper, we characterize the class of {\em contraction perfect} graphs which are the graphs that remain perfect after the contraction of any edge set. We prove that a graph is contraction perfect if and only if it is perfect and the…
The existence of an extremal self-dual binary linear code of length 120 is a long-standing open problem. We continue the investigation of its automorphism group, proving that automorphisms of order 30 and 57 cannot occur. Supposing the…
Let $K$ be any field of characteristic two and let $U_1$ and $W_1$ be the Lie algebras of the derivations of the algebra of Laurent polynomials $K[t,t^{-1}]$ and of the polynomial ring $K[t]$, respectively. The algebras $U_1$ and $W_1$ are…
Linear codes are the most important family of codes in cryptography and coding theory. Some codes have only a few weights and are widely used in many areas, such as authentication codes, secret sharing schemes and strongly regular graphs.…