Behavioral Models for List Decoding

Margreta Kuijper and Jan Willem Polderman

Mathematical and Computer Modelling of Dynamical Systems, 2002, vol. 8, issue 4, 429-443

Abstract: Recently it has been shown that list decoding of Reed-Solomon codes may be translated into a bivariate interpolation problem. The data consist of pairs in a finite field and the aim is to find a bivariate polynomial that interpolates the given pairs and is minimal with respect to some criterion. We present a systems theoretic approach to this interpolation problem. With the data points we associate a set of time series, also called trajectories. For this set of trajectories we construct the Most Powerful Unfalsified Model (MPUM). This is the smallest possible model that explains these trajectories. The bivariate polynomial is then derived from a specific polynomial representation of the MPUM.

Date: 2002
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1076/mcmd.8.4.429.15849 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:nmcmxx:v:8:y:2002:i:4:p:429-443

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/NMCM20

DOI: 10.1076/mcmd.8.4.429.15849

Access Statistics for this article

Mathematical and Computer Modelling of Dynamical Systems is currently edited by I. Troch

More articles in Mathematical and Computer Modelling of Dynamical Systems from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().