Related papers: Evaluation of iterated Ore polynomials and skew Re…
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…
A general class of polynomial remainder codes is considered. Such codes are very flexible in rate and length and include Reed-Solomon codes as a special case. As an extension of previous work, two joint error-and-erasure decoding approaches…
We define and study a class of Reed-Muller type error-correcting codes obtained from elementary symmetric functions in finitely many variables. We determine the code parameters and higher weight spectra in the simplest cases.
The concepts of evaluation and interpolation are extended from univariate skew polynomials to multivariate skew polynomials, with coefficients over division rings. Iterated skew polynomial rings are in general not suitable for this purpose.…
It is known that multiple zeta values can be written in terms of certain iterated log-sine integrals. Conversely, we evaluate iterated log-sine integrals in terms of multiple polylogarithms and multiple zeta values in this paper. We also…
We develop a fast algorithm for computing the bound of an Ore polynomial over a skew field, under mild conditions. As an application, we state a criterion for deciding whether a bounded Ore polynomial is irreducible, and we discuss a…
For iterated Ore extensions satisfying a polynomial identity we present an elementary way of erasing derivations. As a consequence we recover some results obtained by Haynal in "PI degree parity in q-skew polynomial rings" (J. Algebra 319,…
In this paper, we study the uniform and couniform dimensions of inverse polynomial modules over skew Ore polynomials.
We give a recursive decoding algorithm for projective Reed-Muller codes making use of a decoder for affine Reed-Muller codes. We determine the number of errors that can be corrected in this way, which is the current highest for decoders of…
In this paper, we investigate the attached prime ideals of inverse polynomial modules over skew Ore polynomials.
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…
This dissertation considers new constructions and decoding approaches for error-correcting codes based on non-conventional polynomials, with the objective of providing new coding solutions to the applications mentioned above. With skew…
In this paper we present a new algorithm for Polynomial Linear System Solving (via evaluation/interpolation) with errors. In this scenario, errors can occur in the black box evaluation step. We improve the bound on the number of errors that…
Reed-Muller codes are among the most important classes of locally correctable codes. Currently local decoding of Reed-Muller codes is based on decoding on lines or quadratic curves to recover one single coordinate. To recover multiple…
We extend recent results in order to construct projective resolutions for modules over twisted tensor products of truncated polynomial rings. We begin by taking note of the conditions necessary to think of these algebras as a type of Ore…
The product formula for evaluating products of skew polynomials is used to construct a class of rings. As an application, we present a method of evaluating quotients of skew polynomials.
We consider weighted Reed-Muller codes over point ensemble $S_1 \times...\times S_m$ where $S_i$ needs not be of the same size as $S_j$. For $m = 2$ we determine optimal weights and analyze in detail what is the impact of the ratio…
We introduce an iterated integral version of (generalized) log-sine integrals (iterated log-sine integrals) and prove a relation between a multiple polylogarithm and iterated log-sine integrals. We also give a new method for obtaining…
We provide a comprehensive overview of the fundamental structural properties of weighted projective Reed-Muller codes. We give a recursive construction for these codes, under some conditions for the weights, and we use it to derive bounds…
The classical Reed-Muller codes over a finite field $\mathbb{F}_q$ are based on evaluations of $m$-variate polynomials of degree at most $d$ over a product set $U^m$, for some $d$ less than $|U|$. Because of their good distance properties,…