Related papers: On Bounds for Ring-Based Coding Theory
We study the problem of computing the Hamming weight of an $n$-bit string modulo $m$, for any positive integer $m \leq n$ whose only prime factors are 2 and 3. We show that the exact quantum query complexity of this problem is $\left\lceil…
Subsystem codes are a generalization of noiseless subsystems, decoherence free subspaces, and quantum error-correcting codes. We prove a Singleton bound for GF(q)-linear subsystem codes. It follows that no subsystem code over a prime field…
Codes in the sum-rank metric have received many attentions in recent years, since they have wide applications in the multishot network coding, the space-time coding and the distributed storage. In this paper, by constructing covering codes…
Motivated by the study of invariant rings of finite groups on the first Weyl algebras $A_{1}$ (\cite{AHV}) and finding interesting families of new noetherian rings, a class of algebras similar to $U(sl_{2})$ were introduced and studied by…
The Fundamental Theorem of Algebra can be thought of as a statement about the real numbers as a space, considered as an algebraic set over the real numbers as a field. This paper introduces what it means for an algebraic set or affine…
We classify the simple infinite dimensional integrable modules with finite dimensional weight spaces over the quantized enveloping algebra of an untwisted affine algebra. We prove that these are either highest (lowest) weight integrable…
We present various approaches to J. Herzog's theory of generalized local cohomology and explore its main aspects, e.g., (non-)vanishing results as well as a general local duality theorem which extends, to a much broader class of rings,…
We consider Abelian topological quantum field theories (TQFTs) in 3d and show that gaugings of invertible global symmetries naturally give rise to additive codes. These codes emerge as nonanomalous subgroups of the 1-form symmetry group,…
In this paper cyclic codes are established with respect to the Mannheim metric over some finite rings by using Gaussian integers and the decoding algorithm for these codes is given.
We construct a class of three-Lee-weight and two infinite families of five-Lee-weight codes over the ring $R=\mathbb{F}_2 +v\mathbb{F}_2 +v^2\mathbb{F}_2 +v^3\mathbb{F}_2 +v^4\mathbb{F}_2,$ where $v^5=1.$ The same ring occurs in the quintic…
In this work, we determine new linear equations for the weight distribution of linear codes over finite chain rings. The identities are determined by counting the number of some special submatrices of the parity-check matrix of the code.…
Let $\ell>0$ be a square-free integer congruent to 3 mod 4 and $\O_K$ the ring of integers of the imaginary quadratic field $K=Q(\sqrt{-\ell})$. Codes $C$ over rings $\O_K / p \O_K$ determine lattices $\Lambda_\ell (C) $ over $K$. If $ p…
Reed-Muller (RM) codes are among the oldest, simplest and perhaps most ubiquitous family of codes. They are used in many areas of coding theory in both electrical engineering and computer science. Yet, many of their important properties are…
In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…
We obtain all possible parameters of Plotkin-optimal two-Lee weight projective codes over $\mathbb{Z}_4,$ together with their weight distributions. We show the existence of codes with these parameters as well as their weight distributions…
We prove the following results regarding the linear solvability of networks over various alphabets. For any network, the following are equivalent: (i) vector linear solvability over some finite field, (ii) scalar linear solvability over…
We present some upper bounds on the size of non-linear codes and their restriction to systematic codes and linear codes. These bounds are independent of other known theoretical bounds, e.g. the Griesmer bound, the Johnson bound or the…
In the present paper, we provide results that relate the Jacobi polynomials in genus $g$. We show that if a code is $t$-homogeneous that is, the codewords of the code for every given weight hold a $t$-design, then its Jacobi polynomial in…
We present an algebraic structure in modules over integer rings with cardinality prime powers, which allows to define bases. With such structure, we prove a similar version for the basis extension theorem of linear algebra over fields.…
This text contains some notes on the Griesmer bound. In particular, we give a geometric proof of the Griesmer bound for the generalized weights and show that a Solomon--Stiffler type construction attains it if the minimum distance is…