Abstract
List decoding may be translated into a bivariate interpolation problem. The interpolation problem is to find a bivariate polynomial of minimal weighted degree that interpolates a given set of pairs taken from a finite field. We present a behavioral approach to this interpolation problem. With the data points we associate a set of trajectories. For this set of trajectories we construct the Most Powerful Unfalsified Model. The bivariate polynomial is then derived from a specific representation of the MPUM.
Original language | English |
---|---|
Title of host publication | Proceedings of the fifteenth International Symposium of Mathematical Theory of Networks and Systems |
Pages | - |
Number of pages | 13 |
Publication status | Published - 2002 |
Event | 15th International Symposium on Mathematical Theory of Networks and Systems, MTNS 2002 - University of Notre Dame, Notre Dame, United States Duration: 12 Aug 2002 → 16 Aug 2002 Conference number: 15 |
Conference
Conference | 15th International Symposium on Mathematical Theory of Networks and Systems, MTNS 2002 |
---|---|
Abbreviated title | MTNS 2002 |
Country/Territory | United States |
City | Notre Dame |
Period | 12/08/02 → 16/08/02 |
Keywords
- METIS-209233
- IR-44404