Related papers: On the binary linear constant weight codes and the…
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…
Let $X$ be a countable discrete Abelian group containing no elements of order 2, $\alpha$ be an automorphism of $X$, $\xi_1$ and $\xi_2$ be independent random variables with values in the group $X$ and distributions $\mu_1$ and $\mu_2$. The…
Linear codes with a few weights are very important in coding theory and have attracted a lot of attention. In this paper, we present a construction of $q$-ary linear codes from trace and norm functions over finite fields. The weight…
We consider linear codes over some fixed finite field extension over an arbitrary finite field. Gabidulin introduced rank metric codes, by endowing linear codes over the extension field with a rank weight over the base field and studied…
Inspired by code vertex operator algebras (VOAs) and their representation theory, we define code algebras, a new class of commutative non-associative algebras constructed from binary linear codes. Let $C$ be a binary linear code of length…
The Homeomorphic Embedding relation has been amply used for defining termination criteria of symbolic methods for program analysis, transformation, and verification. However, homeomorphic embedding has never been investigated in the context…
We investigate linear and additive codes in partially ordered Hamming-like spaces that satisfy the extension property, meaning that automorphisms of ideals extend to automorphisms of the poset. The codes are naturally described in terms of…
We introduce new sufficient conditions for permutation and monomial equivalence of linear cyclic codes over various finite fields. We recall that monomial equivalence and isometric equivalence are the same relation for linear codes over…
The adjacency matrix associated with a convolutional code collects in a detailed manner information about the weight distribution of the code. A MacWilliams Identity Conjecture, stating that the adjacency matrix of a code fully determines…
We show that the Beurling algebra with a weight-dependent convolution and the group algebra $L^1(G)$ are isomorphic. In particular, using this isomorphism, we extend some results of the algebra $\mathscr{L}^1(G,\omega)$ presented in recent…
In this paper we consider some classical varieties of linear algebras over the field which has characteristic 0. For every considered variety we take a category of the finite generated free algebras of this variety. And for every this…
In this paper, we study a relative two-weight $\mathbb{Z}_2 \mathbb{Z}_4$-additive codes. It is shown that the Gray image of a two-distance $\mathbb{Z}_2 \mathbb{Z}_4$-additive code is a binary two-distance code and that the Gray image of a…
The present work proves that the folk-lore of the pathology of non-conservation of probability in quantum anisotropic models is wrong. It is shown in full generality that all operator ordering can lead to a Hamiltonian with a self-adjoint…
The automorphism group of the Barnes-Wall lattice L_m in dimension 2^m (m not 3) is a subgroup of index 2 in a certain ``Clifford group'' C_m (an extraspecial group of order 2^(1+2m) extended by an orthogonal group). This group and its…
We determine the automorphism group of Gabidulin codes of full length and characterise when these codes are equivalent to self-dual codes.
We prove an asymptotic formula for a variant of the binary additive divisor problem with linear factors in the arguments, which has a power saving error term and which is uniform in all involved parameters.
It is known that for binary codes one can use Gr\"obner bases to obtain a subset of codewords of minimal support that can be used to determine the second generalized Hamming weight of the code. In this paper we establish conditions on a…
We describe some pseudorandom properties of binary linear codes achieving capacity on the binary erasure channel under bit-MAP decoding (as shown in Kudekar et al this includes doubly transitive codes and, in particular, Reed-Muller codes).…
We introduce a code construction for Wess-Zumino-Witten (WZW) models associated with simply-laced affine Lie algebras at level 1. The chiral primary fields of these rational CFTs can be parametrized by the elements of the outer automorphism…
Let $C$ be a four-weight binary code, which has all one vector. Furthermore, we assume that $C$ supports $t$-designs for all weights obtained from the Assmus--Mattson theorem. We previously showed that $t\leq 5$. In the present paper, we…