Related papers: Duality and decoding of linearized Algebraic Geome…
We establish a duality result between linear index coding and Locally Repairable Codes (LRCs). Specifically, we show that a natural extension of LRCs we call Generalized Locally Repairable Codes (GLCRs) are exactly dual to linear index…
In this article we use linear algebra to improve the computational time for the obtaining of Green's functions of linear differential equations with reflection (DER). This is achieved by decomposing both the `reduced' equation (the ODE…
In this note, we use give some algebraic applications of a previous result by the author which compares the deformations parameterized by the Maurer-Cartan elements of a differential graded Lie algebra, and a differential graded Lie…
Differential Convolutional Codes with designed Hamming distance are defined, and an algebraic decoding algorithm, inspired by Peterson-Gorenstein-Zierler's algorithm, is designed for them.
We generalize Helberg's number-theoretic construction of multiple insertion-deletion correcting binary codes to non-binary alphabets and describe a linear decoding algorithm for correcting multiple deletions.
We present a new algorithm to decide isomorphism between finite graded algebras. For a broad class of nilpotent Lie algebras, we demonstrate that it runs in time polynomial in the order of the input algebras. We introduce heuristics that…
We prove the existence of the dualizing functor for a separated morphism of algebraic stacks with affine diagonal; then we explicitly develop duality for compact Deligne-Mumford stacks focusing in particular on the morphism from a stack to…
Automorphism Ensemble (AE) decoding has recently drawn attention as a possible alternative to list decoding of polar codes. In this letter, we investigate the distribution of Partially-Symmetric Reed-Muller (PS-RM) codes, a family of polar…
This paper is concerned with list decoding of $2$-interleaved binary alternant codes. The principle of the proposed algorithm is based on a combination of a list decoding algorithm for (interleaved) Reed-Solomon codes and an algorithm for…
Non-binary codes correcting multiple deletions have recently attracted a lot of attention. In this work, we focus on multiplicity-free codes, a family of non-binary codes where all symbols are distinct. Our main contribution is a new…
Multiplication by the pseudoscalar $\mathbf{I}$ has been traditionally used in geometric algebra to perform non-metric operations such as calculating coordinates and the regressive product. In algebras with degenerate metrics, such as…
We introduce the sum-rank metric analogue of Reed--Muller codes, which we called linearized Reed--Muller codes, using multivariate Ore polynomials. We study the parameters of these codes, compute their dimension and give a lower bound for…
We prove a Riemann-Roch theorem of an entirely novel nature for divisors on the Arakelov compactification of the algebraic spectrum of the integers. This result relies on the introduction of three key concepts: the cohomologies (attached to…
We address the problem of duality between the coloured extension of the quantised algebra of functions on a group and that of its quantised universal enveloping algebra i.e. its dual. In particular, we derive explicitly the algebra dual to…
A lot of attention has been paid to the investigation of the algebraic properties of linear codes. In most cases, this investigation involves the determination of required code automorphisms, which are useful for decoders, such as the…
We initiate the study of the duality theory of locally recoverable codes, with a focus on the applications. We characterize the locality of a code in terms of the dual code, and introduce a class of invariants that refine the classical…
This paper presents encoding and decoding algorithms for several families of optimal rank metric codes whose codes are in restricted forms of symmetric, alternating and Hermitian matrices. First, we show the evaluation encoding is the right…
We use localization techniques to study duality in N = 2 supersymmetric gauge theories in three dimensions. Specifically, we consider a duality due to Aharony involving unitary and symplectic gauge groups, which is similar to Seiberg…
Algebraic decoding algorithms are commonly applied for the decoding of Reed-Solomon codes. Their main advantages are low computational complexity and predictable decoding capabilities. Many algorithms can be extended for correction of both…
The aim of this paper is twofold. First, we introduce a new class of linearizations, based on the generalization of a construction used in polynomial algebra to find the zeros of a system of (scalar) polynomial equations. We show that one…