Related papers: Unique Decoding of Plane AG Codes Revisited
Gr\"obner Bases and Cylindrical Algebraic Decomposition are generally thought of as two, rather different, methods of looking at systems of equations and, in the case of Cylindrical Algebraic Decomposition, inequalities. However, even for a…
In this work we develop the theory of Gr\"obner bases for modules over the ring of univariate linearized polynomials with coefficients from a finite field.
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…
A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs,…
We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…
We present an approach to constructing a practical coarsening algorithm and interpolation operator for the algebraic multigrid (AMG) method, tailored towards systems of partial differential equations (PDEs) with large near-kernels, such as…
In [4] we describe a variation of the classical permutation decoding algorithm that can be applied to any binary affine-invariant code; in particular, it can be applied to first-order Reed-Muller codes successfully. In this paper we study…
In this note, we extend modular techniques for computing Gr\"obner bases from the commutative setting to the vast class of noncommutative $G$-algebras. As in the commutative case, an effective verification test is only known to us in the…
In this manuscript, we consider decoding Grassmann codes, linear codes associated to Grassmannian of planes in an affine space. We look at the orbit structure of Grassmannian arising from the natural action of multiplicative group of…
The binary Reed-Muller codes can be characterized as the radical powers of a modular algebra. We use the Groebner bases to decode these codes.
In this paper we introduce a binomial ideal derived from a binary linear code. We present some applications of a Gr\"obner basis of this ideal with respect to a total degree ordering. In the first application we give a decoding method for…
We propose a new class of efficient decoding algorithms for Reed-Muller (RM) codes over binary-input memoryless channels. The algorithms are based on projecting the code on its cosets, recursively decoding the projected codes (which are…
In this paper, a lemma in algebraic coding theory is established, which is frequently appeared in the encoding and decoding for algebraic codes such as Reed-Solomon codes and algebraic geometry codes. This lemma states that two vector…
We propose a new more efficient method for the computation of two-sided Gr\"obner bases of ideals and bimodules shifting the problem to the enveloping algebra. Arising from the ideas this method involves, we introduce the notion of…
This work introduces a decoding strategy for binary self-dual codes possessing an automorphism of a specific type. The proposed algorithm is a hard decision iterative decoding scheme. The enclosed experiments show that the new decoding…
We present an efficient list decoding algorithm in the style of Guruswami-Sudan for algebraic geometry codes. Our decoder can decode any such code using $\tilde{\mathcal O}(s\ell^{\omega}\mu^{\omega-1}(n+g))$ operations in the underlying…
This work focuses on the study of partial differential equation (PDE) based basis function for Discontinuous Galerkin methods to solve numerically wave-related boundary value problems with variable coefficients. To tackle problems with…
Plane geometry problem solving (PGPS) has recently gained significant attention as a benchmark to assess the multi-modal reasoning capabilities of large vision-language models. Despite the growing interest in PGPS, the research community…
We show how Gabidulin codes can be decoded via parametrization by using interpolation modules over the ring of linearized polynomials with composition. Our decoding algorithm computes a list of message words that correspond to all closest…
An alternative method for collaborative decoding of interleaved Reed-Solomon codes as well as Gabidulin codes for the case of high interleaving degree is proposed. As an example of application, simulation results are presented for a…