Related papers: Testing Tensor Products of Algebraic Codes
We construct two new families of linear codes by modifying the generator matrices of generalized Reed-Solomon (GRS) codes. For these codes, we explicitly derive parity-check matrices and establish necessary and sufficient conditions…
We give a description of the duals of linearized Reed-Solomon codes in terms of codes obtained by taking residues of Ore rational functions. Our construction shows in particular that, under some assumptions on the base field, the class of…
We construct Locally Recoverable Codes (LRCs) with availability $2$ from a family of fibered surfaces. To obtain the locality and availability properties, and to estimate the minimum distance of the codes, we combine techniques coming from…
We consider the problem of determining the expected dimension of the star product of two uniformly random linear codes that are not necessarily of the same dimension. We achieve this by establishing a correspondence between the star product…
Several notions of code products are known in quantum error correction, such as hyper-graph products, homological products, lifted products, balanced products, to name a few. In this paper we introduce a new product code construction which…
We give an algebraic approach to the study of Hitchin pairs and prove the tensor product theorem for Higgs semistable Hitchin pairs over smooth projective curves defined over algebraically closed fields $k$ of characteristic $0$ and…
The starting point of this work is that the class of evolution algebras over a fixed field is closed under tensor product. This arises questions about the inheritance of properties from the tensor product to the factors and conversely. For…
We present a program that allows for the computation of tensor products of irreducible representations of Lie algebras A-G based on the explicit construction of weight states. This straightforward approach (which is slower and more…
Let $p$ be a prime and let $q$ be a power of $p$. In this paper, by using generalized Reed-Solomon (GRS for short) codes and extended GRS codes, we construct two new classes of quantum maximum-distance- separable (MDS) codes with parameters…
We use tilting modules to study the structure of the tensor product of two simple modules for the algebraic group $\SL_2$, in positive characteristic, obtaining a twisted tensor product theorem for its indecomposable direct summands.…
Certifiable local robustness, which rigorously precludes small-norm adversarial examples, has received significant attention as a means of addressing security concerns in deep learning. However, for some classification problems, local…
New families of algebras and DG algebras with two simple modules are introduced and described. Using the twisted tensor product operation, we prove that such algebras have finite global dimension, and the resulting DG algebras are smooth.…
A binary linear error correcting codes represented by two code families Kronecker products sum are considered. The dimension and distance of new code is investigated. Upper and lower bounds of distance are obtained. Some examples are given.…
We construct a double-toric surface code by exploiting the planar tessellation using a rhombus-shaped tile. With n data qubits, we are able to encode at least n/3 logical qubits or quantum memories. By a suitable arrangement of the tiles,…
Error-correcting codes and related combinatorial constructs play an important role in several recent (and old) results in computational complexity theory. In this paper we survey results on locally-testable and locally-decodable…
We propose a unified theory of generalized weights for linear codes endowed with an arbitrary distance. Instead of relying on supports or anticodes, the weights of a code are defined via the intersections of the code with a chosen family of…
The techniques of distance verification known for general linear codes are re-applied to quantum stabilizer codes. Then distance verification is addressed for classical and quantum LDPC codes. New complexity bounds for distance verification…
Generalized product codes (GPCs) are extensions of product codes (PCs) where code symbols are protected by two component codes but not necessarily arranged in a rectangular array. We consider a deterministic construction of GPCs (as opposed…
One of the oldest problems in coding theory is to match the Gilbert-Varshamov bound with explicit binary codes. Over larger-yet still constant-sized-fields, algebraic-geometry codes are known to beat the GV bound. In this work, we leverage…
Both maximum distance separable (MDS) codes that are not equivalent to generalized Reed-Solomon (GRS) codes (non-GRS MDS codes) and near MDS (NMDS) codes have nice applications in communication and storage systems. In this paper, we…