Related papers: Additive Tridiagonal Codes over $\mathbb{F}_{4}$
Matrix multiplication over the real field constitutes a foundational operation in the training of deep learning models, serving as a computational cornerstone for both forward and backward propagation processes. However, the presence of…
We consider the problem of secure distributed matrix multiplication (SDMM). Coded computation has been shown to be an effective solution in distributed matrix multiplication, both providing privacy against workers and boosting the…
A ${\mathbb{Z}}_2{\mathbb{Z}}_4$-additive code ${\cal C}\subseteq{\mathbb{Z}}_2^\alpha\times{\mathbb{Z}}_4^\beta$ is called cyclic if the set of coordinates can be partitioned into two subsets, the set of ${\mathbb{Z}}_2$ and the set of…
The intersection problem for additive (extended and non-extended) perfect codes, i.e. which are the possibilities for the number of codewords in the intersection of two additive codes C1 and C2 of the same length, is investigated. Lower and…
Supporting multiple partial computations efficiently at each of the workers is a keystone in distributed coded computing in order to speed up computations and to fully exploit the resources of heterogeneous workers in terms of…
Self-orthogonal codes have received great attention due to their important applications in quantum codes, LCD codes and lattices. Recently, several families of self-orthogonal codes containing the all-$1$ vector were constructed by…
A projective linear code over $\mathbb{F}_q$ is called $\Delta$-divisible if all weights of its codewords are divisible by $\Delta$. Especially, $q^r$-divisible projective linear codes, where $r$ is some integer, arise in many applications…
In this paper, we study the algebraic structure of Z_2[u]Z_2[u, v]-additive codes which are Z_2[u, v]-submodules where u^2 = v^2 = 0 and uv = vu. In particular, we determine a Gray map from Z_2[u]Z_2 [u, v] to Z_2^{2{\alpha}+8\b{eta}} and…
We introduce a unified generalization of several well-established high-throughput coding techniques including staircase codes, tiled diagonal zipper codes, continuously interleaved codes, open forward error correction (OFEC) codes, and…
Linear codes are widely studied in coding theory as they have nice applications in distributed storage, combinatorics, lattices, cryptography and so on. Constructing linear codes with desirable properties is an interesting research topic.…
Constant dimension codes are e.g. used for error correction and detection in random linear network coding, so that constructions for these codes have achieved wide attention. Here, we improve over 150 lower bounds by describing better…
In this study, linear codes having their Lee-weight distributions over the semi-local ring $\mathbb{F}_{q}+u\mathbb{F}_{q}$ with $u^{2}=1$ are constructed using the defining set and Gauss sums for an odd prime $q $. Moreover, we derive…
Using linear functional-based duality of modules, we generalize the syndrome decoding algorithm of linear codes over finite fields to those over finite commutative rings. Moreover, If the ring is local the algorithm is simplified by…
A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field was recently presented in [10]. Shortly after this, a generalization for the sufficient numerical conditions of such characterization…
In this paper, by using the trace map of Frobenius, we consider problems on extending sections for positive characteristic threefolds.
Methods were developed in Ref. [1] for constructing reference metrics (and from them differentiable structures) on three-dimensional manifolds with topologies specified by suitable triangulations. This note generalizes those methods by…
In this work, we propose a modified four circulant construction for self-dual codes and a bordered version of the construction using the properties of \lambda-circulant and \lambda-reverse circulant matrices. By using the constructions on…
Recently, the notions of self-orthogonal subspace codes and LCD subspace codes were introduced, and LCD subspace codes obtained from mutually unbiased weighing matrices were studied. In this paper, we provide a method of constructing…
Let $V$ denote a nonzero finite-dimensional vector space. A tridiagonal pair on $V$ is an ordered pair $A, A^*$ of maps in ${\rm End}(V)$ such that (i) each of $A, A^*$ is diagonalizable; (ii) there exists an ordering $\lbrace V_i…
Surface and color codes are two forms of topological quantum error correction in two spatial dimensions with complementary properties. Surface codes have lower-depth error detection circuits and well-developed decoders to interpret and…