Algorithms for decoding and interpolation
The paper considers various algorithms for decoding certain error-correcting codes and their relationship with interpolation methods in system theory. It is shown how a system-theoretic modeling procedure, based on a procedural approach, gives rise to interpolating solutions with common factors in a natural way, and, as a consequence, makes it relevant to coding theoretic applications. Thus various decoding algorithms, the Berlekamp-Massey algorithm in particular, can be viewed as a special instance of a modeling procedure which led to a multivariable algorithm in systems, which in turn was used to improve the decoding of BCH codes. It is also shown in this paper how the Welch-Berlekamp key equation of decoding can be reformulated as minimal modeling of a finite dimensional behavior. A modification of it is presented and again shown to be another special instance of the modeling procedure. Thus both the Berlekamp-Massey and Welch-Berlekamp algorithms are shown to be special instances of one general iterative behavioral modeling procedure. For the entire collection see [Zbl 0960.00082].
This page was built for publication: Algorithms for decoding and interpolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2776530)
