Related papers: A Dynamical System-based Key Equation for Decoding…
An iterative scheme for the Dynamical Systems Method (DSM) is given such that one does not have to solve the Cauchy problem occuring in the application of the DSM for solving ill-conditioned linear algebraic systems. The novelty of the…
For Reed-Solomon codes, the key equation relates the syndrome polynomial---computed from the parity check matrix and the received vector---to two unknown polynomials, the locator and the evaluator. The roots of the locator polynomial…
Sparse polynomial interpolation, sparse linear system solving or modular rational reconstruction are fundamental problems in Computer Algebra. They come down to computing linear recurrence relations of a sequence with the Berlekamp-Massey…
Consider an operator equation (*) $B(u)+\ep u=0$ in a real Hilbert space, where $\ep>0$ is a small constant. The DSM (dynamical systems method) for solving equation (*) consists of a construction of a Cauchy problem, which has the following…
We study the computation of error values in the decoding of codes constructed from order domains. Our approach is based on a sort of analog of the key equation for decoding Reed-Solomon and BCH codes. We identify a key equation for all…
We present a recursive minimal polynomial theorem for finite sequences over a commutative integral domain $D$. This theorem is relative to any element of $D$. The ingredients are: the arithmetic of Laurent polynomials over $D$, a recursive…
This paper proposes a novel algorithm for finding error-locators of algebraic-geometric codes that can eliminate the division-calculations of finite fields from the Berlekamp-Massey-Sakata algorithm. This inverse-free algorithm provides…
We study the problem of the computation of Groebner basis for the ideal of linear recurring relations of a doubly periodic array. We find a set of indexes such that, along with some conditions, guarantees that the set of polynomials…
By a numerical continuation method called a diagonal homotopy we can compute the intersection of two positive dimensional solution sets of polynomial systems. This paper proposes to use this diagonal homotopy as the key step in a procedure…
Consider an operator equation $F(u)=0$ in a real Hilbert space. The problem of solving this equation is ill-posed if the operator $F'(u)$ is not boundedly invertible, and well-posed otherwise. A general method, dynamical systems method…
A new method, the Dynamical Systems Method (DSM), justified recently, is applied to solving ill-conditioned linear algebraic system (ICLAS). The DSM gives a new approach to solving a wide class of ill-posed problems. In this paper a new…
Incorporating a priori physics knowledge into machine learning leads to more robust and interpretable algorithms. In this work, we combine deep learning techniques and classic numerical methods for differential equations to address two…
In this paper, a new algebraic soft-decision decoding algorithm for Reed-Solomon code is presented. It is based on rational interpolation and the interpolation points are constructed by Berlekamp-Messay algorithm. Unlike the traditional…
We explore how to build a vector field from the various functions involved in a given mathematical program, and show that locally-stable equilibria of the underlying dynamical system are precisely the local solutions of the optimization…
The article deals with a lexicographic order in various sequences. Consider the axiomatic of lexicographic series, based on the properties of the natural numbers. Elements of the set are ordered first the code length; further in each sign…
This paper deals with the computation of polytopic invariant sets for polynomial dynamical systems. An invariant set of a dynamical system is a subset of the state space such that if the state of the system belongs to the set at a given…
An efficient procedure for error-value calculations based on fast discrete Fourier transforms (DFT) in conjunction with Berlekamp-Massey-Sakata algorithm for a class of affine variety codes is proposed. Our procedure is achieved by…
We exhibit differential geometric structures that arise in numerical methods, based on the construction of Cauchy sequences, that are currently used to prove explicitly the existence of weak solutions to functional equations. We describe…
Encoding a sequence of observations is an essential task with many applications. The encoding can become highly efficient when the observations are generated by a dynamical system. A dynamical system imposes regularities on the observations…
The two primary decoding algorithms for Reed-Solomon codes are the Berlekamp-Massey algorithm and the Sugiyama et al. adaptation of the Euclidean algorithm, both designed to solve a key equation. In this article an alternative version of…