Related papers: General Linearized Polynomial Interpolation and It…
Subspace codes were introduced in order to correct errors and erasures for randomized network coding, in the case where network topology is unknown (the noncoherent case). Subspace codes are indeed collections of subspaces of a certain…
To the best of our knowledge this paper is the first attempt to introduce and study polynomial interpolation of the polynomial data given on arbitrary varieties. In the first part of the paper we present results on the solvability of such…
Generalized Reed-Solomon (GRS) and Gabidulin codes have been proposed for various code-based cryptosystems, though most such schemes without elaborate disguising techniques have been successfully attacked. Both code classes are prominent…
Complexity bounds for many problems on matrices with univariate polynomial entries have been improved in the last few years. Still, for most related algorithms, efficient implementations are not available, which leaves open the question of…
Consider a sparse polynomial in several variables given explicitly as a sum of non-zero terms with coefficients in an effective field. In this paper, we present several algorithms for factoring such polynomials and related tasks (such as…
Most of the codes that have an algebraic decoding algorithm are derived from the Reed Solomon codes. They are obtained by taking equivalent codes, for example the generalized Reed Solomon codes, or by using the so-called subfield subcode…
We obtain a new coding and decoding method using the generalized Pell $(p,i)$ -numbers. The relations among the code matrix elements, error detection and correction have been established for this coding theory. We give two new blocking…
The present paper contains two interrelated developments. First, are proposed new generalized Verma modules. They are called k-Verma modules, k\in N, and coincide with the usual Verma modules for k=1. As a vector space a k-Verma module is…
The recently introduced polynomial time integration framework proposes a novel way to construct time integrators for solving systems of first-order ordinary differential equation by using interpolating polynomials in the complex time plane.…
We consider recursive decoding for Reed-Muller (RM) codes and their subcodes. Two new recursive techniques are described. We analyze asymptotic properties of these algorithms and show that they substantially outperform other decoding…
In this paper, we study how to quickly compute the <-minimal monomial interpolating basis for a multivariate polynomial interpolation problem. We address the notion of "reverse" reduced basis of linearly independent polynomials and design…
In this paper we combine many of the standard and more recent algebraic techniques for testing isomorphism of finite groups (GpI) with combinatorial techniques that have typically been applied to Graph Isomorphism. In particular, we show…
We survey the known list decoding algorithms for polar codes and compare their complexity. Index terms: Polar codes; Reed-Muller codes; successive cancellation decoding.
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,…
This paper presents a method to determine a set of basis polynomials from the extended Euclidean algorithm that allows Generalized Minimum Distance decoding of Reed-Solomon codes with a complexity of O(nd).
An iterative decoding algorithm for convolutional codes is presented. It successively processes $N$ consecutive blocks of the received word in order to decode the first block. A bound is presented showing which error configurations can be…
The multigrid algorithm is an efficient numerical method for solving a variety of elliptic partial differential equations (PDEs). The method damps errors at progressively finer grid scales, resulting in faster convergence compared to…
We discuss the decoding of Gabidulin and interleaved Gabidulin codes. We give the full presentation of a decoding algorithm for Gabidulin codes, which as Loidreau's seminal algorithm consists in localizing errors in the spirit of…
A novel decoding algorithm is developed for general quantum convolutional codes. Exploiting useful ideas from classical coding theory, the new decoder introduces two innovations that drastically reduce the decoding complexity compared to…
Consider a sparse multivariate polynomial f with integer coefficients. Assume that f is represented as a "modular black box polynomial", e.g. via an algorithm to evaluate f at arbitrary integer points, modulo arbitrary positive integers.…